./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5848a086cbcd6c30e9bba20a6b8b5cbc1660f3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:08:58,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:08:58,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:08:58,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:08:58,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:08:58,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:08:58,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:08:58,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:08:58,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:08:58,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:08:58,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:08:58,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:08:58,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:08:58,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:08:58,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:08:58,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:08:58,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:08:58,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:08:58,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:08:58,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:08:58,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:08:58,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:08:58,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:08:58,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:08:58,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:08:58,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:08:58,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:08:58,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:08:58,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:08:58,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:08:58,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:08:58,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:08:58,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:08:58,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:08:58,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:08:58,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:08:58,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:08:58,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:08:58,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:08:58,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:08:58,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:08:58,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:08:58,259 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:08:58,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:08:58,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:08:58,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:08:58,260 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:08:58,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:08:58,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:08:58,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:08:58,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:58,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:08:58,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:08:58,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:08:58,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:08:58,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:08:58,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:08:58,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c5848a086cbcd6c30e9bba20a6b8b5cbc1660f3 [2019-12-07 16:08:58,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:08:58,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:08:58,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:08:58,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:08:58,383 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:08:58,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i [2019-12-07 16:08:58,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/data/7b107988b/3c83156477194b8eb30448f3123d4870/FLAG04137746f [2019-12-07 16:08:58,839 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:08:58,840 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/sv-benchmarks/c/pthread-wmm/podwr001_power.opt.i [2019-12-07 16:08:58,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/data/7b107988b/3c83156477194b8eb30448f3123d4870/FLAG04137746f [2019-12-07 16:08:59,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/data/7b107988b/3c83156477194b8eb30448f3123d4870 [2019-12-07 16:08:59,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:08:59,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:08:59,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:59,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:08:59,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:08:59,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82a85e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59, skipping insertion in model container [2019-12-07 16:08:59,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:08:59,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:59,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:59,489 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:08:59,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:59,575 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:08:59,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59 WrapperNode [2019-12-07 16:08:59,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:59,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:59,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:08:59,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:08:59,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:59,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:08:59,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:08:59,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:08:59,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... [2019-12-07 16:08:59,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:08:59,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:08:59,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:08:59,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:08:59,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:08:59,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:08:59,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:08:59,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:08:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:08:59,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:08:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:08:59,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:08:59,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:08:59,679 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 16:09:00,039 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:09:00,039 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:09:00,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:09:00 BoogieIcfgContainer [2019-12-07 16:09:00,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:09:00,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:09:00,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:09:00,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:09:00,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:08:59" (1/3) ... [2019-12-07 16:09:00,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71322ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:09:00, skipping insertion in model container [2019-12-07 16:09:00,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:59" (2/3) ... [2019-12-07 16:09:00,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71322ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:09:00, skipping insertion in model container [2019-12-07 16:09:00,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:09:00" (3/3) ... [2019-12-07 16:09:00,044 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.opt.i [2019-12-07 16:09:00,051 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:09:00,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:09:00,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:09:00,056 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,082 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,111 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:09:00,122 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:09:00,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:09:00,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:09:00,135 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:09:00,135 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:09:00,135 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:09:00,135 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:09:00,135 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:09:00,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:09:00,146 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-07 16:09:00,147 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 16:09:00,202 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 16:09:00,202 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:09:00,211 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:09:00,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 16:09:00,256 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 16:09:00,256 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:09:00,261 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:09:00,277 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 16:09:00,277 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:09:03,170 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 16:09:03,466 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-07 16:09:03,466 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 16:09:03,469 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-07 16:09:22,782 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-07 16:09:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-07 16:09:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:09:22,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:22,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:09:22,788 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-07 16:09:22,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:22,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254986056] [2019-12-07 16:09:22,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:22,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254986056] [2019-12-07 16:09:22,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:22,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:09:22,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062445249] [2019-12-07 16:09:22,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:09:22,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:09:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:22,938 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-07 16:09:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:23,798 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-07 16:09:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:09:23,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:09:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:24,259 INFO L225 Difference]: With dead ends: 125570 [2019-12-07 16:09:24,260 INFO L226 Difference]: Without dead ends: 111010 [2019-12-07 16:09:24,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-07 16:09:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-07 16:09:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-07 16:09:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-07 16:09:31,733 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-07 16:09:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:31,733 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-07 16:09:31,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:09:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-07 16:09:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:09:31,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:31,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:31,737 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-07 16:09:31,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:31,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342492281] [2019-12-07 16:09:31,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342492281] [2019-12-07 16:09:31,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:09:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003246523] [2019-12-07 16:09:31,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:31,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:31,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:31,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:31,800 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-07 16:09:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:32,749 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-07 16:09:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:32,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:09:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:33,547 INFO L225 Difference]: With dead ends: 172646 [2019-12-07 16:09:33,547 INFO L226 Difference]: Without dead ends: 172548 [2019-12-07 16:09:33,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:41,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-07 16:09:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-07 16:09:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-07 16:09:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-07 16:09:43,788 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-07 16:09:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:43,788 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-07 16:09:43,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-07 16:09:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:09:43,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:43,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:43,794 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:43,794 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-07 16:09:43,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:43,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895822990] [2019-12-07 16:09:43,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:43,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895822990] [2019-12-07 16:09:43,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:43,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:09:43,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501521633] [2019-12-07 16:09:43,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:43,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:43,850 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 4 states. [2019-12-07 16:09:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:44,981 INFO L93 Difference]: Finished difference Result 228902 states and 931210 transitions. [2019-12-07 16:09:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:44,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:09:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:45,580 INFO L225 Difference]: With dead ends: 228902 [2019-12-07 16:09:45,581 INFO L226 Difference]: Without dead ends: 228790 [2019-12-07 16:09:45,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228790 states. [2019-12-07 16:09:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228790 to 192327. [2019-12-07 16:09:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192327 states. [2019-12-07 16:09:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192327 states to 192327 states and 796272 transitions. [2019-12-07 16:09:57,763 INFO L78 Accepts]: Start accepts. Automaton has 192327 states and 796272 transitions. Word has length 13 [2019-12-07 16:09:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:57,764 INFO L462 AbstractCegarLoop]: Abstraction has 192327 states and 796272 transitions. [2019-12-07 16:09:57,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 192327 states and 796272 transitions. [2019-12-07 16:09:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:09:57,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:57,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:09:57,772 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-07 16:09:57,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:57,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079657730] [2019-12-07 16:09:57,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:57,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079657730] [2019-12-07 16:09:57,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:57,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:09:57,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951964720] [2019-12-07 16:09:57,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:09:57,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:09:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:09:57,812 INFO L87 Difference]: Start difference. First operand 192327 states and 796272 transitions. Second operand 3 states. [2019-12-07 16:09:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:59,357 INFO L93 Difference]: Finished difference Result 280788 states and 1158875 transitions. [2019-12-07 16:09:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:09:59,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:09:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:00,072 INFO L225 Difference]: With dead ends: 280788 [2019-12-07 16:10:00,072 INFO L226 Difference]: Without dead ends: 280788 [2019-12-07 16:10:00,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280788 states. [2019-12-07 16:10:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280788 to 222888. [2019-12-07 16:10:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222888 states. [2019-12-07 16:10:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222888 states to 222888 states and 926633 transitions. [2019-12-07 16:10:11,689 INFO L78 Accepts]: Start accepts. Automaton has 222888 states and 926633 transitions. Word has length 16 [2019-12-07 16:10:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:11,689 INFO L462 AbstractCegarLoop]: Abstraction has 222888 states and 926633 transitions. [2019-12-07 16:10:11,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:10:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 222888 states and 926633 transitions. [2019-12-07 16:10:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:10:11,697 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:11,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:11,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-07 16:10:11,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:11,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324165176] [2019-12-07 16:10:11,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:11,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324165176] [2019-12-07 16:10:11,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:11,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:10:11,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499965087] [2019-12-07 16:10:11,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:10:11,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:11,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:10:11,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:10:11,755 INFO L87 Difference]: Start difference. First operand 222888 states and 926633 transitions. Second operand 5 states. [2019-12-07 16:10:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:13,243 INFO L93 Difference]: Finished difference Result 298473 states and 1226263 transitions. [2019-12-07 16:10:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:10:13,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:10:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:14,005 INFO L225 Difference]: With dead ends: 298473 [2019-12-07 16:10:14,005 INFO L226 Difference]: Without dead ends: 298473 [2019-12-07 16:10:14,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298473 states. [2019-12-07 16:10:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298473 to 237826. [2019-12-07 16:10:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237826 states. [2019-12-07 16:10:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237826 states to 237826 states and 988542 transitions. [2019-12-07 16:10:28,854 INFO L78 Accepts]: Start accepts. Automaton has 237826 states and 988542 transitions. Word has length 16 [2019-12-07 16:10:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:28,854 INFO L462 AbstractCegarLoop]: Abstraction has 237826 states and 988542 transitions. [2019-12-07 16:10:28,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:10:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 237826 states and 988542 transitions. [2019-12-07 16:10:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:10:28,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:28,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:28,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash -504931817, now seen corresponding path program 1 times [2019-12-07 16:10:28,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:28,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947359075] [2019-12-07 16:10:28,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:28,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947359075] [2019-12-07 16:10:28,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:28,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:10:28,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444400588] [2019-12-07 16:10:28,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:10:28,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:10:28,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:28,910 INFO L87 Difference]: Start difference. First operand 237826 states and 988542 transitions. Second operand 3 states. [2019-12-07 16:10:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:30,333 INFO L93 Difference]: Finished difference Result 237826 states and 978678 transitions. [2019-12-07 16:10:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:10:30,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:10:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:30,930 INFO L225 Difference]: With dead ends: 237826 [2019-12-07 16:10:30,931 INFO L226 Difference]: Without dead ends: 237826 [2019-12-07 16:10:30,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237826 states. [2019-12-07 16:10:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237826 to 234480. [2019-12-07 16:10:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234480 states. [2019-12-07 16:10:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234480 states to 234480 states and 966258 transitions. [2019-12-07 16:10:41,427 INFO L78 Accepts]: Start accepts. Automaton has 234480 states and 966258 transitions. Word has length 18 [2019-12-07 16:10:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:41,427 INFO L462 AbstractCegarLoop]: Abstraction has 234480 states and 966258 transitions. [2019-12-07 16:10:41,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:10:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 234480 states and 966258 transitions. [2019-12-07 16:10:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:10:41,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:41,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:41,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:41,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash 138207619, now seen corresponding path program 1 times [2019-12-07 16:10:41,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:41,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266673862] [2019-12-07 16:10:41,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:41,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266673862] [2019-12-07 16:10:41,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:41,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:10:41,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978858111] [2019-12-07 16:10:41,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:10:41,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:10:41,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:41,467 INFO L87 Difference]: Start difference. First operand 234480 states and 966258 transitions. Second operand 3 states. [2019-12-07 16:10:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:41,595 INFO L93 Difference]: Finished difference Result 42613 states and 138837 transitions. [2019-12-07 16:10:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:10:41,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:10:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:41,655 INFO L225 Difference]: With dead ends: 42613 [2019-12-07 16:10:41,655 INFO L226 Difference]: Without dead ends: 42613 [2019-12-07 16:10:41,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42613 states. [2019-12-07 16:10:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42613 to 42613. [2019-12-07 16:10:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42613 states. [2019-12-07 16:10:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42613 states to 42613 states and 138837 transitions. [2019-12-07 16:10:44,351 INFO L78 Accepts]: Start accepts. Automaton has 42613 states and 138837 transitions. Word has length 18 [2019-12-07 16:10:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:44,351 INFO L462 AbstractCegarLoop]: Abstraction has 42613 states and 138837 transitions. [2019-12-07 16:10:44,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:10:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42613 states and 138837 transitions. [2019-12-07 16:10:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:10:44,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:44,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:44,357 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-07 16:10:44,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:44,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120910159] [2019-12-07 16:10:44,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120910159] [2019-12-07 16:10:44,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:10:44,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820351945] [2019-12-07 16:10:44,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:10:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:10:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:10:44,400 INFO L87 Difference]: Start difference. First operand 42613 states and 138837 transitions. Second operand 6 states. [2019-12-07 16:10:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:44,945 INFO L93 Difference]: Finished difference Result 65056 states and 205947 transitions. [2019-12-07 16:10:44,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:10:44,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 16:10:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:45,039 INFO L225 Difference]: With dead ends: 65056 [2019-12-07 16:10:45,039 INFO L226 Difference]: Without dead ends: 65042 [2019-12-07 16:10:45,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:10:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2019-12-07 16:10:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 42278. [2019-12-07 16:10:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-12-07 16:10:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 137592 transitions. [2019-12-07 16:10:45,918 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 137592 transitions. Word has length 22 [2019-12-07 16:10:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:45,919 INFO L462 AbstractCegarLoop]: Abstraction has 42278 states and 137592 transitions. [2019-12-07 16:10:45,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:10:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 137592 transitions. [2019-12-07 16:10:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:10:45,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:45,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:45,928 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-07 16:10:45,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:45,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123368847] [2019-12-07 16:10:45,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:46,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123368847] [2019-12-07 16:10:46,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:46,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:10:46,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355822088] [2019-12-07 16:10:46,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:10:46,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:10:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:46,020 INFO L87 Difference]: Start difference. First operand 42278 states and 137592 transitions. Second operand 7 states. [2019-12-07 16:10:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:46,540 INFO L93 Difference]: Finished difference Result 59726 states and 189950 transitions. [2019-12-07 16:10:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:10:46,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 16:10:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:46,630 INFO L225 Difference]: With dead ends: 59726 [2019-12-07 16:10:46,630 INFO L226 Difference]: Without dead ends: 59700 [2019-12-07 16:10:46,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:10:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59700 states. [2019-12-07 16:10:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59700 to 50129. [2019-12-07 16:10:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50129 states. [2019-12-07 16:10:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50129 states to 50129 states and 162181 transitions. [2019-12-07 16:10:47,648 INFO L78 Accepts]: Start accepts. Automaton has 50129 states and 162181 transitions. Word has length 25 [2019-12-07 16:10:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:47,649 INFO L462 AbstractCegarLoop]: Abstraction has 50129 states and 162181 transitions. [2019-12-07 16:10:47,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:10:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 50129 states and 162181 transitions. [2019-12-07 16:10:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:10:47,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:47,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:47,664 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-07 16:10:47,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:47,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838316857] [2019-12-07 16:10:47,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:47,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838316857] [2019-12-07 16:10:47,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:47,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:10:47,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014903942] [2019-12-07 16:10:47,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:10:47,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:10:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:10:47,713 INFO L87 Difference]: Start difference. First operand 50129 states and 162181 transitions. Second operand 6 states. [2019-12-07 16:10:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:48,185 INFO L93 Difference]: Finished difference Result 71592 states and 224983 transitions. [2019-12-07 16:10:48,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:10:48,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 16:10:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:48,287 INFO L225 Difference]: With dead ends: 71592 [2019-12-07 16:10:48,288 INFO L226 Difference]: Without dead ends: 71508 [2019-12-07 16:10:48,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:10:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71508 states. [2019-12-07 16:10:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71508 to 53724. [2019-12-07 16:10:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53724 states. [2019-12-07 16:10:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53724 states to 53724 states and 172706 transitions. [2019-12-07 16:10:49,518 INFO L78 Accepts]: Start accepts. Automaton has 53724 states and 172706 transitions. Word has length 27 [2019-12-07 16:10:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:49,519 INFO L462 AbstractCegarLoop]: Abstraction has 53724 states and 172706 transitions. [2019-12-07 16:10:49,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:10:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 53724 states and 172706 transitions. [2019-12-07 16:10:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:10:49,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:49,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:49,537 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash -969078927, now seen corresponding path program 1 times [2019-12-07 16:10:49,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:49,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18936189] [2019-12-07 16:10:49,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:49,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18936189] [2019-12-07 16:10:49,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:49,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:10:49,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766683335] [2019-12-07 16:10:49,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:10:49,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:10:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:10:49,575 INFO L87 Difference]: Start difference. First operand 53724 states and 172706 transitions. Second operand 4 states. [2019-12-07 16:10:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:49,634 INFO L93 Difference]: Finished difference Result 20754 states and 64022 transitions. [2019-12-07 16:10:49,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:10:49,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 16:10:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:49,657 INFO L225 Difference]: With dead ends: 20754 [2019-12-07 16:10:49,657 INFO L226 Difference]: Without dead ends: 20754 [2019-12-07 16:10:49,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:10:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20754 states. [2019-12-07 16:10:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20754 to 19543. [2019-12-07 16:10:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19543 states. [2019-12-07 16:10:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 60338 transitions. [2019-12-07 16:10:49,950 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 60338 transitions. Word has length 29 [2019-12-07 16:10:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:49,950 INFO L462 AbstractCegarLoop]: Abstraction has 19543 states and 60338 transitions. [2019-12-07 16:10:49,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:10:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 60338 transitions. [2019-12-07 16:10:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:10:49,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:49,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:49,968 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:49,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-07 16:10:49,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:49,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602861036] [2019-12-07 16:10:49,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:50,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602861036] [2019-12-07 16:10:50,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:50,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:10:50,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893133337] [2019-12-07 16:10:50,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:10:50,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:50,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:10:50,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:50,014 INFO L87 Difference]: Start difference. First operand 19543 states and 60338 transitions. Second operand 7 states. [2019-12-07 16:10:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:50,736 INFO L93 Difference]: Finished difference Result 27225 states and 81337 transitions. [2019-12-07 16:10:50,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:10:50,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 16:10:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:50,770 INFO L225 Difference]: With dead ends: 27225 [2019-12-07 16:10:50,770 INFO L226 Difference]: Without dead ends: 27225 [2019-12-07 16:10:50,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:10:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27225 states. [2019-12-07 16:10:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27225 to 19532. [2019-12-07 16:10:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19532 states. [2019-12-07 16:10:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19532 states to 19532 states and 60108 transitions. [2019-12-07 16:10:51,115 INFO L78 Accepts]: Start accepts. Automaton has 19532 states and 60108 transitions. Word has length 33 [2019-12-07 16:10:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:51,115 INFO L462 AbstractCegarLoop]: Abstraction has 19532 states and 60108 transitions. [2019-12-07 16:10:51,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:10:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19532 states and 60108 transitions. [2019-12-07 16:10:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:10:51,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:51,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:51,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:51,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1293540528, now seen corresponding path program 1 times [2019-12-07 16:10:51,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:51,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990151683] [2019-12-07 16:10:51,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:51,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990151683] [2019-12-07 16:10:51,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:51,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:10:51,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000070706] [2019-12-07 16:10:51,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:10:51,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:10:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:51,175 INFO L87 Difference]: Start difference. First operand 19532 states and 60108 transitions. Second operand 3 states. [2019-12-07 16:10:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:51,227 INFO L93 Difference]: Finished difference Result 18664 states and 56622 transitions. [2019-12-07 16:10:51,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:10:51,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 16:10:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:51,248 INFO L225 Difference]: With dead ends: 18664 [2019-12-07 16:10:51,248 INFO L226 Difference]: Without dead ends: 18664 [2019-12-07 16:10:51,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2019-12-07 16:10:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 18390. [2019-12-07 16:10:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18390 states. [2019-12-07 16:10:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18390 states to 18390 states and 55854 transitions. [2019-12-07 16:10:51,507 INFO L78 Accepts]: Start accepts. Automaton has 18390 states and 55854 transitions. Word has length 40 [2019-12-07 16:10:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:51,507 INFO L462 AbstractCegarLoop]: Abstraction has 18390 states and 55854 transitions. [2019-12-07 16:10:51,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:10:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 18390 states and 55854 transitions. [2019-12-07 16:10:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 16:10:51,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:51,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:51,522 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -448595313, now seen corresponding path program 1 times [2019-12-07 16:10:51,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757722530] [2019-12-07 16:10:51,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:51,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757722530] [2019-12-07 16:10:51,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:51,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:10:51,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422922361] [2019-12-07 16:10:51,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:10:51,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:10:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:10:51,577 INFO L87 Difference]: Start difference. First operand 18390 states and 55854 transitions. Second operand 5 states. [2019-12-07 16:10:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:51,644 INFO L93 Difference]: Finished difference Result 16867 states and 52454 transitions. [2019-12-07 16:10:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:10:51,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 16:10:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:51,665 INFO L225 Difference]: With dead ends: 16867 [2019-12-07 16:10:51,665 INFO L226 Difference]: Without dead ends: 16867 [2019-12-07 16:10:51,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:10:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16867 states. [2019-12-07 16:10:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16867 to 15238. [2019-12-07 16:10:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15238 states. [2019-12-07 16:10:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15238 states to 15238 states and 47616 transitions. [2019-12-07 16:10:51,901 INFO L78 Accepts]: Start accepts. Automaton has 15238 states and 47616 transitions. Word has length 41 [2019-12-07 16:10:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:51,901 INFO L462 AbstractCegarLoop]: Abstraction has 15238 states and 47616 transitions. [2019-12-07 16:10:51,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:10:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15238 states and 47616 transitions. [2019-12-07 16:10:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:10:51,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:51,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:51,915 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1623524162, now seen corresponding path program 1 times [2019-12-07 16:10:51,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:51,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963212572] [2019-12-07 16:10:51,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:51,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963212572] [2019-12-07 16:10:51,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:51,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:10:51,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030051690] [2019-12-07 16:10:51,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:10:51,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:10:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:51,958 INFO L87 Difference]: Start difference. First operand 15238 states and 47616 transitions. Second operand 3 states. [2019-12-07 16:10:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:52,036 INFO L93 Difference]: Finished difference Result 18380 states and 57153 transitions. [2019-12-07 16:10:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:10:52,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:10:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:52,056 INFO L225 Difference]: With dead ends: 18380 [2019-12-07 16:10:52,056 INFO L226 Difference]: Without dead ends: 18380 [2019-12-07 16:10:52,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:10:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-12-07 16:10:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 15494. [2019-12-07 16:10:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15494 states. [2019-12-07 16:10:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15494 states to 15494 states and 48492 transitions. [2019-12-07 16:10:52,327 INFO L78 Accepts]: Start accepts. Automaton has 15494 states and 48492 transitions. Word has length 66 [2019-12-07 16:10:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:52,327 INFO L462 AbstractCegarLoop]: Abstraction has 15494 states and 48492 transitions. [2019-12-07 16:10:52,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:10:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 15494 states and 48492 transitions. [2019-12-07 16:10:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:10:52,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:52,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:52,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 600429612, now seen corresponding path program 1 times [2019-12-07 16:10:52,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:52,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823007314] [2019-12-07 16:10:52,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:52,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823007314] [2019-12-07 16:10:52,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:52,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:10:52,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082272698] [2019-12-07 16:10:52,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:10:52,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:10:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:10:52,390 INFO L87 Difference]: Start difference. First operand 15494 states and 48492 transitions. Second operand 4 states. [2019-12-07 16:10:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:52,490 INFO L93 Difference]: Finished difference Result 18353 states and 57063 transitions. [2019-12-07 16:10:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:10:52,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 16:10:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:52,510 INFO L225 Difference]: With dead ends: 18353 [2019-12-07 16:10:52,510 INFO L226 Difference]: Without dead ends: 18353 [2019-12-07 16:10:52,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:10:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18353 states. [2019-12-07 16:10:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18353 to 15150. [2019-12-07 16:10:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15150 states. [2019-12-07 16:10:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15150 states to 15150 states and 47431 transitions. [2019-12-07 16:10:52,767 INFO L78 Accepts]: Start accepts. Automaton has 15150 states and 47431 transitions. Word has length 67 [2019-12-07 16:10:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:52,767 INFO L462 AbstractCegarLoop]: Abstraction has 15150 states and 47431 transitions. [2019-12-07 16:10:52,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:10:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 15150 states and 47431 transitions. [2019-12-07 16:10:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:10:52,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:52,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:52,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-07 16:10:52,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664232394] [2019-12-07 16:10:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:52,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664232394] [2019-12-07 16:10:52,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:52,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:10:52,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975171350] [2019-12-07 16:10:52,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:10:52,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:10:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:10:52,905 INFO L87 Difference]: Start difference. First operand 15150 states and 47431 transitions. Second operand 10 states. [2019-12-07 16:10:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:54,175 INFO L93 Difference]: Finished difference Result 35073 states and 109582 transitions. [2019-12-07 16:10:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 16:10:54,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 16:10:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:54,201 INFO L225 Difference]: With dead ends: 35073 [2019-12-07 16:10:54,201 INFO L226 Difference]: Without dead ends: 24437 [2019-12-07 16:10:54,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:10:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24437 states. [2019-12-07 16:10:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24437 to 18082. [2019-12-07 16:10:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18082 states. [2019-12-07 16:10:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18082 states to 18082 states and 56427 transitions. [2019-12-07 16:10:54,516 INFO L78 Accepts]: Start accepts. Automaton has 18082 states and 56427 transitions. Word has length 67 [2019-12-07 16:10:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:54,516 INFO L462 AbstractCegarLoop]: Abstraction has 18082 states and 56427 transitions. [2019-12-07 16:10:54,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:10:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18082 states and 56427 transitions. [2019-12-07 16:10:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:10:54,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:54,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:54,531 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:54,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1908292690, now seen corresponding path program 2 times [2019-12-07 16:10:54,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:54,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286693133] [2019-12-07 16:10:54,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:54,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286693133] [2019-12-07 16:10:54,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:54,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:10:54,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394996022] [2019-12-07 16:10:54,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:10:54,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:54,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:10:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:10:54,651 INFO L87 Difference]: Start difference. First operand 18082 states and 56427 transitions. Second operand 10 states. [2019-12-07 16:10:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:55,750 INFO L93 Difference]: Finished difference Result 30684 states and 95180 transitions. [2019-12-07 16:10:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:10:55,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 16:10:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:55,780 INFO L225 Difference]: With dead ends: 30684 [2019-12-07 16:10:55,780 INFO L226 Difference]: Without dead ends: 26361 [2019-12-07 16:10:55,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:10:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26361 states. [2019-12-07 16:10:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26361 to 18534. [2019-12-07 16:10:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18534 states. [2019-12-07 16:10:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18534 states to 18534 states and 57675 transitions. [2019-12-07 16:10:56,120 INFO L78 Accepts]: Start accepts. Automaton has 18534 states and 57675 transitions. Word has length 67 [2019-12-07 16:10:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:56,120 INFO L462 AbstractCegarLoop]: Abstraction has 18534 states and 57675 transitions. [2019-12-07 16:10:56,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:10:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 18534 states and 57675 transitions. [2019-12-07 16:10:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:10:56,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:56,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:56,135 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash 993635084, now seen corresponding path program 3 times [2019-12-07 16:10:56,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:56,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482579199] [2019-12-07 16:10:56,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:56,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482579199] [2019-12-07 16:10:56,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:56,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:10:56,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289240820] [2019-12-07 16:10:56,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:10:56,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:56,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:10:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:10:56,272 INFO L87 Difference]: Start difference. First operand 18534 states and 57675 transitions. Second operand 11 states. [2019-12-07 16:10:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:58,602 INFO L93 Difference]: Finished difference Result 29036 states and 89939 transitions. [2019-12-07 16:10:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 16:10:58,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:10:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:58,632 INFO L225 Difference]: With dead ends: 29036 [2019-12-07 16:10:58,632 INFO L226 Difference]: Without dead ends: 25553 [2019-12-07 16:10:58,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-07 16:10:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2019-12-07 16:10:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 18102. [2019-12-07 16:10:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18102 states. [2019-12-07 16:10:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18102 states to 18102 states and 56343 transitions. [2019-12-07 16:10:58,960 INFO L78 Accepts]: Start accepts. Automaton has 18102 states and 56343 transitions. Word has length 67 [2019-12-07 16:10:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:58,960 INFO L462 AbstractCegarLoop]: Abstraction has 18102 states and 56343 transitions. [2019-12-07 16:10:58,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:10:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 18102 states and 56343 transitions. [2019-12-07 16:10:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:10:58,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:58,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:58,976 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 397917466, now seen corresponding path program 4 times [2019-12-07 16:10:58,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:58,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700708906] [2019-12-07 16:10:58,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700708906] [2019-12-07 16:10:59,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:59,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:10:59,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767755789] [2019-12-07 16:10:59,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:10:59,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:10:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:10:59,111 INFO L87 Difference]: Start difference. First operand 18102 states and 56343 transitions. Second operand 12 states. [2019-12-07 16:11:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:02,368 INFO L93 Difference]: Finished difference Result 29148 states and 90323 transitions. [2019-12-07 16:11:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 16:11:02,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 16:11:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:02,403 INFO L225 Difference]: With dead ends: 29148 [2019-12-07 16:11:02,403 INFO L226 Difference]: Without dead ends: 26075 [2019-12-07 16:11:02,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:11:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26075 states. [2019-12-07 16:11:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26075 to 18324. [2019-12-07 16:11:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18324 states. [2019-12-07 16:11:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18324 states to 18324 states and 56925 transitions. [2019-12-07 16:11:02,734 INFO L78 Accepts]: Start accepts. Automaton has 18324 states and 56925 transitions. Word has length 67 [2019-12-07 16:11:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:02,734 INFO L462 AbstractCegarLoop]: Abstraction has 18324 states and 56925 transitions. [2019-12-07 16:11:02,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:11:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18324 states and 56925 transitions. [2019-12-07 16:11:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:11:02,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:02,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:02,750 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1803113718, now seen corresponding path program 5 times [2019-12-07 16:11:02,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:02,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667333957] [2019-12-07 16:11:02,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:02,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667333957] [2019-12-07 16:11:02,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:02,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:11:02,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064874273] [2019-12-07 16:11:02,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:11:02,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:02,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:11:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:11:02,874 INFO L87 Difference]: Start difference. First operand 18324 states and 56925 transitions. Second operand 12 states. [2019-12-07 16:11:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:04,099 INFO L93 Difference]: Finished difference Result 27306 states and 84540 transitions. [2019-12-07 16:11:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:11:04,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 16:11:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:04,128 INFO L225 Difference]: With dead ends: 27306 [2019-12-07 16:11:04,128 INFO L226 Difference]: Without dead ends: 26115 [2019-12-07 16:11:04,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:11:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26115 states. [2019-12-07 16:11:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26115 to 18192. [2019-12-07 16:11:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18192 states. [2019-12-07 16:11:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18192 states to 18192 states and 56581 transitions. [2019-12-07 16:11:04,447 INFO L78 Accepts]: Start accepts. Automaton has 18192 states and 56581 transitions. Word has length 67 [2019-12-07 16:11:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:04,448 INFO L462 AbstractCegarLoop]: Abstraction has 18192 states and 56581 transitions. [2019-12-07 16:11:04,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:11:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18192 states and 56581 transitions. [2019-12-07 16:11:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:11:04,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:04,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:04,463 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 6 times [2019-12-07 16:11:04,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:04,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373345333] [2019-12-07 16:11:04,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:04,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373345333] [2019-12-07 16:11:04,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:04,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:11:04,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654994256] [2019-12-07 16:11:04,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:11:04,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:11:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:11:04,607 INFO L87 Difference]: Start difference. First operand 18192 states and 56581 transitions. Second operand 13 states. [2019-12-07 16:11:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:09,127 INFO L93 Difference]: Finished difference Result 32406 states and 99661 transitions. [2019-12-07 16:11:09,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 16:11:09,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 16:11:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:09,160 INFO L225 Difference]: With dead ends: 32406 [2019-12-07 16:11:09,160 INFO L226 Difference]: Without dead ends: 27991 [2019-12-07 16:11:09,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1034, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:11:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27991 states. [2019-12-07 16:11:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27991 to 18120. [2019-12-07 16:11:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-07 16:11:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 56177 transitions. [2019-12-07 16:11:09,506 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 56177 transitions. Word has length 67 [2019-12-07 16:11:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:09,507 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 56177 transitions. [2019-12-07 16:11:09,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:11:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 56177 transitions. [2019-12-07 16:11:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:11:09,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:09,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:09,522 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 7 times [2019-12-07 16:11:09,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:09,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107906508] [2019-12-07 16:11:09,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:09,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107906508] [2019-12-07 16:11:09,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:09,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:11:09,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993759249] [2019-12-07 16:11:09,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:11:09,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:11:09,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:11:09,653 INFO L87 Difference]: Start difference. First operand 18120 states and 56177 transitions. Second operand 13 states. [2019-12-07 16:11:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:13,206 INFO L93 Difference]: Finished difference Result 29716 states and 91192 transitions. [2019-12-07 16:11:13,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:11:13,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 16:11:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:13,239 INFO L225 Difference]: With dead ends: 29716 [2019-12-07 16:11:13,239 INFO L226 Difference]: Without dead ends: 28489 [2019-12-07 16:11:13,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:11:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28489 states. [2019-12-07 16:11:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28489 to 18040. [2019-12-07 16:11:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18040 states. [2019-12-07 16:11:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18040 states to 18040 states and 55957 transitions. [2019-12-07 16:11:13,605 INFO L78 Accepts]: Start accepts. Automaton has 18040 states and 55957 transitions. Word has length 67 [2019-12-07 16:11:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:13,605 INFO L462 AbstractCegarLoop]: Abstraction has 18040 states and 55957 transitions. [2019-12-07 16:11:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:11:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18040 states and 55957 transitions. [2019-12-07 16:11:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:11:13,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:13,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:13,621 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1867129146, now seen corresponding path program 8 times [2019-12-07 16:11:13,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:13,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967938897] [2019-12-07 16:11:13,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:13,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967938897] [2019-12-07 16:11:13,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:13,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:11:13,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329680071] [2019-12-07 16:11:13,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:11:13,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:11:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:11:13,677 INFO L87 Difference]: Start difference. First operand 18040 states and 55957 transitions. Second operand 6 states. [2019-12-07 16:11:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:13,960 INFO L93 Difference]: Finished difference Result 46030 states and 141680 transitions. [2019-12-07 16:11:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:11:13,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-07 16:11:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:14,004 INFO L225 Difference]: With dead ends: 46030 [2019-12-07 16:11:14,004 INFO L226 Difference]: Without dead ends: 36318 [2019-12-07 16:11:14,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:11:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36318 states. [2019-12-07 16:11:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36318 to 18868. [2019-12-07 16:11:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18868 states. [2019-12-07 16:11:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 58521 transitions. [2019-12-07 16:11:14,411 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 58521 transitions. Word has length 67 [2019-12-07 16:11:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:14,411 INFO L462 AbstractCegarLoop]: Abstraction has 18868 states and 58521 transitions. [2019-12-07 16:11:14,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:11:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 58521 transitions. [2019-12-07 16:11:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:11:14,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:14,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:14,428 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 9 times [2019-12-07 16:11:14,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:14,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521450529] [2019-12-07 16:11:14,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:11:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:11:14,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:11:14,518 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:11:14,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= (store .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23| 1) |v_#valid_60|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1564~0.base_23| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23|) |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1564~0.base_23|) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1564~0.offset=|v_ULTIMATE.start_main_~#t1564~0.offset_17|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_12|, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ULTIMATE.start_main_~#t1564~0.base=|v_ULTIMATE.start_main_~#t1564~0.base_23|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1564~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1566~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1566~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1565~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1564~0.base, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1565~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1565~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11|) |v_ULTIMATE.start_main_~#t1565~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11|)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1565~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1565~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1565~0.offset] because there is no mapped edge [2019-12-07 16:11:14,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-880547683 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-880547683 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-880547683| ~z$w_buff1~0_In-880547683)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-880547683| ~z~0_In-880547683) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-880547683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880547683, ~z$w_buff1~0=~z$w_buff1~0_In-880547683, ~z~0=~z~0_In-880547683} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-880547683|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-880547683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880547683, ~z$w_buff1~0=~z$w_buff1~0_In-880547683, ~z~0=~z~0_In-880547683} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:11:14,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 16:11:14,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13|) |v_ULTIMATE.start_main_~#t1566~0.offset_11| 2)) |v_#memory_int_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1566~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1566~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1566~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1566~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1566~0.offset] because there is no mapped edge [2019-12-07 16:11:14,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1630674381 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1630674381 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1630674381| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1630674381| ~z$w_buff0_used~0_In-1630674381) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1630674381, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1630674381} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1630674381, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1630674381|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1630674381} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:11:14,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1305003496 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1305003496 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1305003496 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1305003496 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1305003496 |P1Thread1of1ForFork2_#t~ite12_Out1305003496|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1305003496|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1305003496, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1305003496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1305003496, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305003496} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1305003496, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1305003496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1305003496, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1305003496|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305003496} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:11:14,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In467764972 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In467764972 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In467764972 |P1Thread1of1ForFork2_#t~ite13_Out467764972|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out467764972|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In467764972, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In467764972} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In467764972, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out467764972|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In467764972} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:11:14,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In108667901 256) 0))) (or (and (= ~z$w_buff0_used~0_In108667901 |P2Thread1of1ForFork0_#t~ite26_Out108667901|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In108667901 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In108667901 256)) .cse1) (= (mod ~z$w_buff0_used~0_In108667901 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In108667901 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out108667901| |P2Thread1of1ForFork0_#t~ite26_Out108667901|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In108667901| |P2Thread1of1ForFork0_#t~ite26_Out108667901|) (not .cse0) (= ~z$w_buff0_used~0_In108667901 |P2Thread1of1ForFork0_#t~ite27_Out108667901|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In108667901|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108667901, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108667901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108667901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In108667901, ~weak$$choice2~0=~weak$$choice2~0_In108667901} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out108667901|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out108667901|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108667901, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108667901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108667901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In108667901, ~weak$$choice2~0=~weak$$choice2~0_In108667901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:11:14,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:11:14,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2005173805 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2005173805 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-2005173805| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-2005173805| ~z$w_buff0_used~0_In-2005173805) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005173805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2005173805} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2005173805|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005173805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2005173805} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:11:14,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:11:14,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-210903343 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-210903343 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-210903343| |P2Thread1of1ForFork0_#t~ite38_Out-210903343|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-210903343| ~z$w_buff1~0_In-210903343) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-210903343 |P2Thread1of1ForFork0_#t~ite38_Out-210903343|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-210903343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210903343, ~z$w_buff1~0=~z$w_buff1~0_In-210903343, ~z~0=~z~0_In-210903343} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-210903343|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-210903343|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-210903343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210903343, ~z$w_buff1~0=~z$w_buff1~0_In-210903343, ~z~0=~z~0_In-210903343} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:11:14,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1983564072 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1983564072 256)))) (or (and (= ~z$w_buff0_used~0_In-1983564072 |P2Thread1of1ForFork0_#t~ite40_Out-1983564072|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1983564072| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983564072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1983564072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983564072, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1983564072|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1983564072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:11:14,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-162336559 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-162336559 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-162336559 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-162336559 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-162336559 |P2Thread1of1ForFork0_#t~ite41_Out-162336559|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-162336559|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-162336559, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-162336559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162336559, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-162336559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-162336559, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-162336559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162336559, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-162336559, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-162336559|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:11:14,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1991186277 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1991186277 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1991186277| ~z$r_buff0_thd3~0_In-1991186277) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1991186277| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991186277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1991186277} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991186277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1991186277, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1991186277|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:11:14,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In328168929 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In328168929 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In328168929 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In328168929 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out328168929| ~z$r_buff1_thd3~0_In328168929) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out328168929|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In328168929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328168929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328168929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328168929} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out328168929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In328168929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328168929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328168929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328168929} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:11:14,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:11:14,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2085928695 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-2085928695 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2085928695 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2085928695 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085928695| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085928695| ~z$w_buff1_used~0_In-2085928695) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2085928695, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2085928695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2085928695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2085928695} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2085928695, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2085928695|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2085928695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2085928695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2085928695} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:11:14,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2139683130 256))) (.cse1 (= ~z$r_buff0_thd1~0_Out2139683130 ~z$r_buff0_thd1~0_In2139683130)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In2139683130 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out2139683130 0) (not .cse0)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2139683130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2139683130} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2139683130, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2139683130|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2139683130} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1009413511 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1009413511 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1009413511 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1009413511 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1009413511|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1009413511 |P0Thread1of1ForFork1_#t~ite8_Out1009413511|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1009413511, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009413511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009413511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009413511} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1009413511|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1009413511, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009413511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009413511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009413511} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:11:14,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:11:14,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-642689231 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-642689231 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-642689231 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-642689231 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-642689231| ~z$r_buff1_thd2~0_In-642689231) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out-642689231| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-642689231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-642689231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-642689231, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-642689231} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-642689231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-642689231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-642689231, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-642689231|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-642689231} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:11:14,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:11:14,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:11:14,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1522767160 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1522767160 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1522767160| |ULTIMATE.start_main_#t~ite47_Out-1522767160|))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1522767160 |ULTIMATE.start_main_#t~ite47_Out-1522767160|)) (and (not .cse2) (not .cse1) .cse0 (= ~z$w_buff1~0_In-1522767160 |ULTIMATE.start_main_#t~ite47_Out-1522767160|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522767160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522767160, ~z$w_buff1~0=~z$w_buff1~0_In-1522767160, ~z~0=~z~0_In-1522767160} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522767160, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1522767160|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522767160, ~z$w_buff1~0=~z$w_buff1~0_In-1522767160, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1522767160|, ~z~0=~z~0_In-1522767160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:11:14,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In542817663 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In542817663 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out542817663|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In542817663 |ULTIMATE.start_main_#t~ite49_Out542817663|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In542817663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542817663} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In542817663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542817663, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out542817663|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:11:14,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-828196207 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-828196207 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-828196207 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-828196207 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-828196207 |ULTIMATE.start_main_#t~ite50_Out-828196207|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-828196207| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-828196207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-828196207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-828196207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828196207} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-828196207|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-828196207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-828196207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-828196207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828196207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:11:14,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In744050150 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In744050150 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In744050150 |ULTIMATE.start_main_#t~ite51_Out744050150|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out744050150| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744050150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744050150} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744050150, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out744050150|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744050150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:11:14,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1476525327 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1476525327 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1476525327 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1476525327 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1476525327 |ULTIMATE.start_main_#t~ite52_Out-1476525327|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1476525327|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1476525327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476525327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1476525327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476525327} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1476525327|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1476525327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476525327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1476525327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476525327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:11:14,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:11:14,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:11:14 BasicIcfg [2019-12-07 16:11:14,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:11:14,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:11:14,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:11:14,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:11:14,597 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:09:00" (3/4) ... [2019-12-07 16:11:14,598 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:11:14,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= (store .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23| 1) |v_#valid_60|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1564~0.base_23| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1564~0.base_23|) |v_ULTIMATE.start_main_~#t1564~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1564~0.base_23|) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (select .cse0 |v_ULTIMATE.start_main_~#t1564~0.base_23|) 0) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1564~0.offset=|v_ULTIMATE.start_main_~#t1564~0.offset_17|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_12|, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ULTIMATE.start_main_~#t1564~0.base=|v_ULTIMATE.start_main_~#t1564~0.base_23|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1564~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1566~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_~#t1566~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1565~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1564~0.base, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1565~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1565~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1565~0.base_11|) |v_ULTIMATE.start_main_~#t1565~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11|)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1565~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1565~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1565~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1565~0.base=|v_ULTIMATE.start_main_~#t1565~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1565~0.offset=|v_ULTIMATE.start_main_~#t1565~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1565~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1565~0.offset] because there is no mapped edge [2019-12-07 16:11:14,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-880547683 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-880547683 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-880547683| ~z$w_buff1~0_In-880547683)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-880547683| ~z~0_In-880547683) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-880547683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880547683, ~z$w_buff1~0=~z$w_buff1~0_In-880547683, ~z~0=~z~0_In-880547683} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-880547683|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-880547683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-880547683, ~z$w_buff1~0=~z$w_buff1~0_In-880547683, ~z~0=~z~0_In-880547683} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:11:14,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 16:11:14,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1566~0.base_13|) |v_ULTIMATE.start_main_~#t1566~0.offset_11| 2)) |v_#memory_int_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13| 1)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1566~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1566~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1566~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1566~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1566~0.base=|v_ULTIMATE.start_main_~#t1566~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1566~0.offset=|v_ULTIMATE.start_main_~#t1566~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1566~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1566~0.offset] because there is no mapped edge [2019-12-07 16:11:14,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1630674381 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1630674381 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1630674381| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1630674381| ~z$w_buff0_used~0_In-1630674381) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1630674381, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1630674381} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1630674381, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1630674381|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1630674381} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:11:14,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1305003496 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1305003496 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1305003496 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1305003496 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1305003496 |P1Thread1of1ForFork2_#t~ite12_Out1305003496|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1305003496|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1305003496, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1305003496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1305003496, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305003496} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1305003496, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1305003496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1305003496, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1305003496|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305003496} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:11:14,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In467764972 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In467764972 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In467764972 |P1Thread1of1ForFork2_#t~ite13_Out467764972|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out467764972|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In467764972, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In467764972} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In467764972, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out467764972|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In467764972} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:11:14,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In108667901 256) 0))) (or (and (= ~z$w_buff0_used~0_In108667901 |P2Thread1of1ForFork0_#t~ite26_Out108667901|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In108667901 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In108667901 256)) .cse1) (= (mod ~z$w_buff0_used~0_In108667901 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In108667901 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out108667901| |P2Thread1of1ForFork0_#t~ite26_Out108667901|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In108667901| |P2Thread1of1ForFork0_#t~ite26_Out108667901|) (not .cse0) (= ~z$w_buff0_used~0_In108667901 |P2Thread1of1ForFork0_#t~ite27_Out108667901|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In108667901|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108667901, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108667901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108667901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In108667901, ~weak$$choice2~0=~weak$$choice2~0_In108667901} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out108667901|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out108667901|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108667901, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In108667901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In108667901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In108667901, ~weak$$choice2~0=~weak$$choice2~0_In108667901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:11:14,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:11:14,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2005173805 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2005173805 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-2005173805| 0)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out-2005173805| ~z$w_buff0_used~0_In-2005173805) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005173805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2005173805} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2005173805|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2005173805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2005173805} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:11:14,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:11:14,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-210903343 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-210903343 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-210903343| |P2Thread1of1ForFork0_#t~ite38_Out-210903343|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-210903343| ~z$w_buff1~0_In-210903343) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-210903343 |P2Thread1of1ForFork0_#t~ite38_Out-210903343|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-210903343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210903343, ~z$w_buff1~0=~z$w_buff1~0_In-210903343, ~z~0=~z~0_In-210903343} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-210903343|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-210903343|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-210903343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210903343, ~z$w_buff1~0=~z$w_buff1~0_In-210903343, ~z~0=~z~0_In-210903343} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:11:14,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1983564072 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1983564072 256)))) (or (and (= ~z$w_buff0_used~0_In-1983564072 |P2Thread1of1ForFork0_#t~ite40_Out-1983564072|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1983564072| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983564072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1983564072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1983564072, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1983564072|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1983564072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:11:14,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-162336559 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-162336559 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-162336559 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-162336559 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-162336559 |P2Thread1of1ForFork0_#t~ite41_Out-162336559|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-162336559|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-162336559, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-162336559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162336559, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-162336559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-162336559, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-162336559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-162336559, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-162336559, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-162336559|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:11:14,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1991186277 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1991186277 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1991186277| ~z$r_buff0_thd3~0_In-1991186277) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1991186277| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991186277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1991186277} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1991186277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1991186277, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1991186277|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:11:14,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In328168929 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In328168929 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In328168929 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In328168929 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out328168929| ~z$r_buff1_thd3~0_In328168929) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out328168929|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In328168929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328168929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328168929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328168929} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out328168929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In328168929, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328168929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328168929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328168929} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:11:14,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:11:14,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2085928695 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-2085928695 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2085928695 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-2085928695 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085928695| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2085928695| ~z$w_buff1_used~0_In-2085928695) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2085928695, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2085928695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2085928695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2085928695} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2085928695, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2085928695|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2085928695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2085928695, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2085928695} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:11:14,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2139683130 256))) (.cse1 (= ~z$r_buff0_thd1~0_Out2139683130 ~z$r_buff0_thd1~0_In2139683130)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In2139683130 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~z$r_buff0_thd1~0_Out2139683130 0) (not .cse0)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2139683130, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2139683130} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2139683130, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2139683130|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2139683130} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:11:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1009413511 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1009413511 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1009413511 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1009413511 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1009413511|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1009413511 |P0Thread1of1ForFork1_#t~ite8_Out1009413511|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1009413511, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009413511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009413511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009413511} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1009413511|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1009413511, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009413511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009413511, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009413511} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:11:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:11:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-642689231 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-642689231 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-642689231 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-642689231 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-642689231| ~z$r_buff1_thd2~0_In-642689231) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out-642689231| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-642689231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-642689231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-642689231, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-642689231} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-642689231, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-642689231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-642689231, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-642689231|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-642689231} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:11:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:11:14,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:11:14,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1522767160 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1522767160 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1522767160| |ULTIMATE.start_main_#t~ite47_Out-1522767160|))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1522767160 |ULTIMATE.start_main_#t~ite47_Out-1522767160|)) (and (not .cse2) (not .cse1) .cse0 (= ~z$w_buff1~0_In-1522767160 |ULTIMATE.start_main_#t~ite47_Out-1522767160|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522767160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522767160, ~z$w_buff1~0=~z$w_buff1~0_In-1522767160, ~z~0=~z~0_In-1522767160} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1522767160, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1522767160|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1522767160, ~z$w_buff1~0=~z$w_buff1~0_In-1522767160, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1522767160|, ~z~0=~z~0_In-1522767160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:11:14,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In542817663 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In542817663 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out542817663|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In542817663 |ULTIMATE.start_main_#t~ite49_Out542817663|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In542817663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542817663} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In542817663, ~z$w_buff0_used~0=~z$w_buff0_used~0_In542817663, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out542817663|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:11:14,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-828196207 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-828196207 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-828196207 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-828196207 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-828196207 |ULTIMATE.start_main_#t~ite50_Out-828196207|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-828196207| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-828196207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-828196207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-828196207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828196207} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-828196207|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-828196207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-828196207, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-828196207, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-828196207} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:11:14,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In744050150 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In744050150 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In744050150 |ULTIMATE.start_main_#t~ite51_Out744050150|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out744050150| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744050150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744050150} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744050150, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out744050150|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744050150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:11:14,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1476525327 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1476525327 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1476525327 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1476525327 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1476525327 |ULTIMATE.start_main_#t~ite52_Out-1476525327|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1476525327|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1476525327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476525327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1476525327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476525327} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1476525327|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1476525327, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1476525327, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1476525327, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1476525327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:11:14,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:11:14,664 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_428beeae-939b-405d-b7fb-5b595b0029dc/bin/uautomizer/witness.graphml [2019-12-07 16:11:14,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:11:14,665 INFO L168 Benchmark]: Toolchain (without parser) took 135464.31 ms. Allocated memory was 1.0 GB in the beginning and 7.3 GB in the end (delta: 6.3 GB). Free memory was 939.2 MB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,665 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:11:14,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,666 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:11:14,666 INFO L168 Benchmark]: RCFGBuilder took 402.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,666 INFO L168 Benchmark]: TraceAbstraction took 134555.92 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 994.3 MB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,667 INFO L168 Benchmark]: Witness Printer took 67.43 ms. Allocated memory is still 7.3 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:11:14,668 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 134555.92 ms. Allocated memory was 1.1 GB in the beginning and 7.3 GB in the end (delta: 6.2 GB). Free memory was 994.3 MB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 67.43 ms. Allocated memory is still 7.3 GB. Free memory was 5.0 GB in the beginning and 5.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1564, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1565, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1566, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5937 SDtfs, 6515 SDslu, 22645 SDs, 0 SdLazy, 19080 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237826occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 314060 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 957 ConstructedInterpolants, 0 QuantifiedInterpolants, 264777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...