./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_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_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/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 c25fe089ad97933d9897fcbf06674a22dab139de ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:42:59,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:42:59,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:42:59,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:42:59,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:42:59,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:42:59,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:42:59,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:42:59,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:42:59,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:42:59,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:42:59,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:42:59,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:42:59,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:42:59,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:42:59,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:42:59,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:42:59,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:42:59,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:42:59,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:42:59,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:42:59,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:42:59,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:42:59,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:42:59,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:42:59,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:42:59,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:42:59,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:42:59,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:42:59,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:42:59,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:42:59,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:42:59,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:42:59,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:42:59,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:42:59,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:42:59,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:42:59,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:42:59,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:42:59,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:42:59,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:42:59,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:42:59,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:42:59,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:42:59,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:42:59,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:42:59,422 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:42:59,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:42:59,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:42:59,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:42:59,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:42:59,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:42:59,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:42:59,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:42:59,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:42:59,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:42:59,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:42:59,424 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:42:59,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:42:59,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:42:59,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:42:59,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:42:59,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:42:59,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:42:59,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:42:59,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:42:59,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:42:59,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:42:59,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:42:59,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:42:59,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:42:59,426 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_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/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 -> c25fe089ad97933d9897fcbf06674a22dab139de [2019-12-07 13:42:59,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:42:59,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:42:59,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:42:59,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:42:59,552 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:42:59,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix011_power.opt.i [2019-12-07 13:42:59,600 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/data/b18bbd53b/781f2d19e7284932af9acd59f41fd63a/FLAG841a0ca95 [2019-12-07 13:42:59,956 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:42:59,957 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/sv-benchmarks/c/pthread-wmm/mix011_power.opt.i [2019-12-07 13:42:59,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/data/b18bbd53b/781f2d19e7284932af9acd59f41fd63a/FLAG841a0ca95 [2019-12-07 13:42:59,978 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/data/b18bbd53b/781f2d19e7284932af9acd59f41fd63a [2019-12-07 13:42:59,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:42:59,981 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:42:59,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:42:59,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:42:59,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:42:59,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:59" (1/1) ... [2019-12-07 13:42:59,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:59, skipping insertion in model container [2019-12-07 13:42:59,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:59" (1/1) ... [2019-12-07 13:42:59,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:43:00,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:43:00,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:00,276 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:43:00,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:43:00,368 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:43:00,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00 WrapperNode [2019-12-07 13:43:00,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:43:00,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:00,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:43:00,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:43:00,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:43:00,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:43:00,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:43:00,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:43:00,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... [2019-12-07 13:43:00,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:43:00,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:43:00,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:43:00,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:43:00,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/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 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:43:00,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:43:00,486 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:43:00,486 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:43:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:43:00,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:43:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:43:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:43:00,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:43:00,488 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 13:43:00,887 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:43:00,887 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:43:00,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:00 BoogieIcfgContainer [2019-12-07 13:43:00,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:43:00,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:43:00,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:43:00,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:43:00,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:42:59" (1/3) ... [2019-12-07 13:43:00,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:00, skipping insertion in model container [2019-12-07 13:43:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:00" (2/3) ... [2019-12-07 13:43:00,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:43:00, skipping insertion in model container [2019-12-07 13:43:00,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:00" (3/3) ... [2019-12-07 13:43:00,893 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.opt.i [2019-12-07 13:43:00,899 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:43:00,899 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:43:00,904 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:43:00,905 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:43:00,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:43:00,968 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:43:00,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:43:00,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:43:00,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:43:00,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:43:00,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:43:00,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:43:00,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:43:00,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:43:00,992 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 13:43:00,993 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 13:43:01,054 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 13:43:01,054 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:01,068 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 13:43:01,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 13:43:01,126 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 13:43:01,126 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:43:01,134 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 909 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 13:43:01,157 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 13:43:01,158 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:43:04,412 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 13:43:04,716 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 13:43:05,049 INFO L206 etLargeBlockEncoding]: Checked pairs total: 115591 [2019-12-07 13:43:05,049 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-07 13:43:05,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 122 transitions [2019-12-07 13:43:07,482 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39870 states. [2019-12-07 13:43:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 39870 states. [2019-12-07 13:43:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:43:07,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:07,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:07,488 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash 191430122, now seen corresponding path program 1 times [2019-12-07 13:43:07,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:07,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768984312] [2019-12-07 13:43:07,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:07,643 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 13:43:07,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768984312] [2019-12-07 13:43:07,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:07,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:43:07,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222964179] [2019-12-07 13:43:07,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:07,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:07,659 INFO L87 Difference]: Start difference. First operand 39870 states. Second operand 3 states. [2019-12-07 13:43:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:08,078 INFO L93 Difference]: Finished difference Result 39574 states and 160408 transitions. [2019-12-07 13:43:08,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:08,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:43:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:08,267 INFO L225 Difference]: With dead ends: 39574 [2019-12-07 13:43:08,267 INFO L226 Difference]: Without dead ends: 36868 [2019-12-07 13:43:08,268 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 13:43:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36868 states. [2019-12-07 13:43:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36868 to 36868. [2019-12-07 13:43:09,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36868 states. [2019-12-07 13:43:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36868 states to 36868 states and 149325 transitions. [2019-12-07 13:43:09,568 INFO L78 Accepts]: Start accepts. Automaton has 36868 states and 149325 transitions. Word has length 7 [2019-12-07 13:43:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:09,569 INFO L462 AbstractCegarLoop]: Abstraction has 36868 states and 149325 transitions. [2019-12-07 13:43:09,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36868 states and 149325 transitions. [2019-12-07 13:43:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:43:09,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:09,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:09,573 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1210424527, now seen corresponding path program 1 times [2019-12-07 13:43:09,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:09,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825549113] [2019-12-07 13:43:09,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:09,635 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 13:43:09,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825549113] [2019-12-07 13:43:09,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:09,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:09,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564777937] [2019-12-07 13:43:09,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:09,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:09,637 INFO L87 Difference]: Start difference. First operand 36868 states and 149325 transitions. Second operand 4 states. [2019-12-07 13:43:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:09,804 INFO L93 Difference]: Finished difference Result 23583 states and 83510 transitions. [2019-12-07 13:43:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:43:09,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:43:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:09,889 INFO L225 Difference]: With dead ends: 23583 [2019-12-07 13:43:09,889 INFO L226 Difference]: Without dead ends: 20877 [2019-12-07 13:43:09,890 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 13:43:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-07 13:43:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 20877. [2019-12-07 13:43:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20877 states. [2019-12-07 13:43:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20877 states to 20877 states and 73863 transitions. [2019-12-07 13:43:10,505 INFO L78 Accepts]: Start accepts. Automaton has 20877 states and 73863 transitions. Word has length 13 [2019-12-07 13:43:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 20877 states and 73863 transitions. [2019-12-07 13:43:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 20877 states and 73863 transitions. [2019-12-07 13:43:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:43:10,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:10,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:10,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash -683536690, now seen corresponding path program 1 times [2019-12-07 13:43:10,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:10,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316678309] [2019-12-07 13:43:10,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:10,566 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 13:43:10,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316678309] [2019-12-07 13:43:10,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:10,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:10,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090946637] [2019-12-07 13:43:10,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:10,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:10,568 INFO L87 Difference]: Start difference. First operand 20877 states and 73863 transitions. Second operand 4 states. [2019-12-07 13:43:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:10,836 INFO L93 Difference]: Finished difference Result 31787 states and 108416 transitions. [2019-12-07 13:43:10,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:10,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:43:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:10,890 INFO L225 Difference]: With dead ends: 31787 [2019-12-07 13:43:10,890 INFO L226 Difference]: Without dead ends: 31772 [2019-12-07 13:43:10,891 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 13:43:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31772 states. [2019-12-07 13:43:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31772 to 30600. [2019-12-07 13:43:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30600 states. [2019-12-07 13:43:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30600 states to 30600 states and 105187 transitions. [2019-12-07 13:43:11,692 INFO L78 Accepts]: Start accepts. Automaton has 30600 states and 105187 transitions. Word has length 14 [2019-12-07 13:43:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:11,692 INFO L462 AbstractCegarLoop]: Abstraction has 30600 states and 105187 transitions. [2019-12-07 13:43:11,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 30600 states and 105187 transitions. [2019-12-07 13:43:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:43:11,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:11,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:11,695 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2049494264, now seen corresponding path program 1 times [2019-12-07 13:43:11,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:11,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132958653] [2019-12-07 13:43:11,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:11,730 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 13:43:11,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132958653] [2019-12-07 13:43:11,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:11,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:11,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751930181] [2019-12-07 13:43:11,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:11,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:11,732 INFO L87 Difference]: Start difference. First operand 30600 states and 105187 transitions. Second operand 4 states. [2019-12-07 13:43:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:11,990 INFO L93 Difference]: Finished difference Result 40226 states and 135997 transitions. [2019-12-07 13:43:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:11,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:43:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:12,054 INFO L225 Difference]: With dead ends: 40226 [2019-12-07 13:43:12,054 INFO L226 Difference]: Without dead ends: 40157 [2019-12-07 13:43:12,054 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 13:43:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40157 states. [2019-12-07 13:43:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40157 to 35465. [2019-12-07 13:43:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-12-07 13:43:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 121322 transitions. [2019-12-07 13:43:12,929 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 121322 transitions. Word has length 16 [2019-12-07 13:43:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:12,929 INFO L462 AbstractCegarLoop]: Abstraction has 35465 states and 121322 transitions. [2019-12-07 13:43:12,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 121322 transitions. [2019-12-07 13:43:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:43:12,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:12,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:43:12,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash -883448571, now seen corresponding path program 1 times [2019-12-07 13:43:12,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:12,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189132681] [2019-12-07 13:43:12,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:13,006 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 13:43:13,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189132681] [2019-12-07 13:43:13,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:13,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:13,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474336746] [2019-12-07 13:43:13,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:13,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:13,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:13,008 INFO L87 Difference]: Start difference. First operand 35465 states and 121322 transitions. Second operand 3 states. [2019-12-07 13:43:13,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:13,200 INFO L93 Difference]: Finished difference Result 62064 states and 213260 transitions. [2019-12-07 13:43:13,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:13,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:43:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:13,313 INFO L225 Difference]: With dead ends: 62064 [2019-12-07 13:43:13,313 INFO L226 Difference]: Without dead ends: 61590 [2019-12-07 13:43:13,313 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 13:43:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61590 states. [2019-12-07 13:43:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61590 to 61466. [2019-12-07 13:43:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61466 states. [2019-12-07 13:43:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61466 states to 61466 states and 211604 transitions. [2019-12-07 13:43:14,607 INFO L78 Accepts]: Start accepts. Automaton has 61466 states and 211604 transitions. Word has length 19 [2019-12-07 13:43:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:14,608 INFO L462 AbstractCegarLoop]: Abstraction has 61466 states and 211604 transitions. [2019-12-07 13:43:14,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 61466 states and 211604 transitions. [2019-12-07 13:43:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:43:14,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:14,616 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] [2019-12-07 13:43:14,617 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1842362510, now seen corresponding path program 1 times [2019-12-07 13:43:14,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:14,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475869581] [2019-12-07 13:43:14,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:14,666 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 13:43:14,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475869581] [2019-12-07 13:43:14,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:14,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:14,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886200715] [2019-12-07 13:43:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:14,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:14,667 INFO L87 Difference]: Start difference. First operand 61466 states and 211604 transitions. Second operand 5 states. [2019-12-07 13:43:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:14,725 INFO L93 Difference]: Finished difference Result 12131 states and 35618 transitions. [2019-12-07 13:43:14,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:14,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 13:43:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:14,733 INFO L225 Difference]: With dead ends: 12131 [2019-12-07 13:43:14,733 INFO L226 Difference]: Without dead ends: 8107 [2019-12-07 13:43:14,734 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 13:43:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8107 states. [2019-12-07 13:43:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8107 to 6794. [2019-12-07 13:43:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6794 states. [2019-12-07 13:43:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6794 states to 6794 states and 18424 transitions. [2019-12-07 13:43:14,814 INFO L78 Accepts]: Start accepts. Automaton has 6794 states and 18424 transitions. Word has length 20 [2019-12-07 13:43:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:14,814 INFO L462 AbstractCegarLoop]: Abstraction has 6794 states and 18424 transitions. [2019-12-07 13:43:14,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6794 states and 18424 transitions. [2019-12-07 13:43:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:43:14,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:14,819 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] [2019-12-07 13:43:14,819 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash 350149048, now seen corresponding path program 1 times [2019-12-07 13:43:14,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:14,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123898054] [2019-12-07 13:43:14,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:14,859 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 13:43:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123898054] [2019-12-07 13:43:14,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:14,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:14,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872377495] [2019-12-07 13:43:14,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:14,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:14,860 INFO L87 Difference]: Start difference. First operand 6794 states and 18424 transitions. Second operand 5 states. [2019-12-07 13:43:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:15,109 INFO L93 Difference]: Finished difference Result 7633 states and 20134 transitions. [2019-12-07 13:43:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:15,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 13:43:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:15,117 INFO L225 Difference]: With dead ends: 7633 [2019-12-07 13:43:15,117 INFO L226 Difference]: Without dead ends: 7632 [2019-12-07 13:43:15,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2019-12-07 13:43:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7226. [2019-12-07 13:43:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7226 states. [2019-12-07 13:43:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 19339 transitions. [2019-12-07 13:43:15,213 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 19339 transitions. Word has length 31 [2019-12-07 13:43:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:15,214 INFO L462 AbstractCegarLoop]: Abstraction has 7226 states and 19339 transitions. [2019-12-07 13:43:15,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 19339 transitions. [2019-12-07 13:43:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:43:15,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:15,219 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] [2019-12-07 13:43:15,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -243852197, now seen corresponding path program 1 times [2019-12-07 13:43:15,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:15,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65156963] [2019-12-07 13:43:15,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:15,275 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 13:43:15,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65156963] [2019-12-07 13:43:15,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:15,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:15,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705499056] [2019-12-07 13:43:15,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:15,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:15,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:15,276 INFO L87 Difference]: Start difference. First operand 7226 states and 19339 transitions. Second operand 4 states. [2019-12-07 13:43:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:15,303 INFO L93 Difference]: Finished difference Result 7257 states and 19410 transitions. [2019-12-07 13:43:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:43:15,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 13:43:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:15,311 INFO L225 Difference]: With dead ends: 7257 [2019-12-07 13:43:15,311 INFO L226 Difference]: Without dead ends: 7257 [2019-12-07 13:43:15,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 13:43:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7257 states. [2019-12-07 13:43:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7257 to 6361. [2019-12-07 13:43:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-12-07 13:43:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 17371 transitions. [2019-12-07 13:43:15,390 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 17371 transitions. Word has length 36 [2019-12-07 13:43:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:15,390 INFO L462 AbstractCegarLoop]: Abstraction has 6361 states and 17371 transitions. [2019-12-07 13:43:15,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 17371 transitions. [2019-12-07 13:43:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:43:15,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:15,397 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] [2019-12-07 13:43:15,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -196896900, now seen corresponding path program 1 times [2019-12-07 13:43:15,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:15,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984988456] [2019-12-07 13:43:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:15,451 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 13:43:15,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984988456] [2019-12-07 13:43:15,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:15,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:15,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023990071] [2019-12-07 13:43:15,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:15,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:15,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:15,453 INFO L87 Difference]: Start difference. First operand 6361 states and 17371 transitions. Second operand 5 states. [2019-12-07 13:43:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:15,694 INFO L93 Difference]: Finished difference Result 7776 states and 20724 transitions. [2019-12-07 13:43:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:15,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 13:43:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:15,701 INFO L225 Difference]: With dead ends: 7776 [2019-12-07 13:43:15,701 INFO L226 Difference]: Without dead ends: 7776 [2019-12-07 13:43:15,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2019-12-07 13:43:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 7382. [2019-12-07 13:43:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7382 states. [2019-12-07 13:43:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7382 states to 7382 states and 19891 transitions. [2019-12-07 13:43:15,781 INFO L78 Accepts]: Start accepts. Automaton has 7382 states and 19891 transitions. Word has length 44 [2019-12-07 13:43:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:15,781 INFO L462 AbstractCegarLoop]: Abstraction has 7382 states and 19891 transitions. [2019-12-07 13:43:15,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7382 states and 19891 transitions. [2019-12-07 13:43:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:43:15,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:15,789 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] [2019-12-07 13:43:15,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 612003683, now seen corresponding path program 1 times [2019-12-07 13:43:15,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:15,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242421133] [2019-12-07 13:43:15,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:15,865 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 13:43:15,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242421133] [2019-12-07 13:43:15,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:15,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:15,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736164284] [2019-12-07 13:43:15,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:15,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:15,867 INFO L87 Difference]: Start difference. First operand 7382 states and 19891 transitions. Second operand 4 states. [2019-12-07 13:43:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:15,911 INFO L93 Difference]: Finished difference Result 10754 states and 28044 transitions. [2019-12-07 13:43:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:43:15,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 13:43:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:15,920 INFO L225 Difference]: With dead ends: 10754 [2019-12-07 13:43:15,920 INFO L226 Difference]: Without dead ends: 10453 [2019-12-07 13:43:15,921 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 13:43:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10453 states. [2019-12-07 13:43:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10453 to 7074. [2019-12-07 13:43:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7074 states. [2019-12-07 13:43:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 19185 transitions. [2019-12-07 13:43:16,034 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 19185 transitions. Word has length 45 [2019-12-07 13:43:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:16,034 INFO L462 AbstractCegarLoop]: Abstraction has 7074 states and 19185 transitions. [2019-12-07 13:43:16,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 19185 transitions. [2019-12-07 13:43:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 13:43:16,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:16,042 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] [2019-12-07 13:43:16,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1174198346, now seen corresponding path program 1 times [2019-12-07 13:43:16,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:16,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378997243] [2019-12-07 13:43:16,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:16,107 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 13:43:16,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378997243] [2019-12-07 13:43:16,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:16,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:43:16,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69711968] [2019-12-07 13:43:16,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:43:16,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:43:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:43:16,108 INFO L87 Difference]: Start difference. First operand 7074 states and 19185 transitions. Second operand 6 states. [2019-12-07 13:43:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:16,164 INFO L93 Difference]: Finished difference Result 5445 states and 15286 transitions. [2019-12-07 13:43:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:16,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 13:43:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:16,169 INFO L225 Difference]: With dead ends: 5445 [2019-12-07 13:43:16,169 INFO L226 Difference]: Without dead ends: 4785 [2019-12-07 13:43:16,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:43:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2019-12-07 13:43:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4002. [2019-12-07 13:43:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4002 states. [2019-12-07 13:43:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 11818 transitions. [2019-12-07 13:43:16,218 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 11818 transitions. Word has length 46 [2019-12-07 13:43:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 4002 states and 11818 transitions. [2019-12-07 13:43:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:43:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 11818 transitions. [2019-12-07 13:43:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:43:16,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:16,223 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] [2019-12-07 13:43:16,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1048346202, now seen corresponding path program 1 times [2019-12-07 13:43:16,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:16,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155159901] [2019-12-07 13:43:16,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:16,277 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 13:43:16,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155159901] [2019-12-07 13:43:16,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:16,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:16,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861492811] [2019-12-07 13:43:16,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:16,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:16,278 INFO L87 Difference]: Start difference. First operand 4002 states and 11818 transitions. Second operand 5 states. [2019-12-07 13:43:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:16,435 INFO L93 Difference]: Finished difference Result 4428 states and 12851 transitions. [2019-12-07 13:43:16,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:16,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-07 13:43:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:16,440 INFO L225 Difference]: With dead ends: 4428 [2019-12-07 13:43:16,440 INFO L226 Difference]: Without dead ends: 4428 [2019-12-07 13:43:16,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2019-12-07 13:43:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4015. [2019-12-07 13:43:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4015 states. [2019-12-07 13:43:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 11849 transitions. [2019-12-07 13:43:16,487 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 11849 transitions. Word has length 61 [2019-12-07 13:43:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:16,488 INFO L462 AbstractCegarLoop]: Abstraction has 4015 states and 11849 transitions. [2019-12-07 13:43:16,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 11849 transitions. [2019-12-07 13:43:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 13:43:16,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:16,493 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] [2019-12-07 13:43:16,493 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1187807450, now seen corresponding path program 2 times [2019-12-07 13:43:16,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940212029] [2019-12-07 13:43:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:16,595 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 13:43:16,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940212029] [2019-12-07 13:43:16,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:16,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:43:16,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894849949] [2019-12-07 13:43:16,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:43:16,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:43:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:43:16,597 INFO L87 Difference]: Start difference. First operand 4015 states and 11849 transitions. Second operand 8 states. [2019-12-07 13:43:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,011 INFO L93 Difference]: Finished difference Result 5978 states and 17078 transitions. [2019-12-07 13:43:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:43:17,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-12-07 13:43:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,017 INFO L225 Difference]: With dead ends: 5978 [2019-12-07 13:43:17,017 INFO L226 Difference]: Without dead ends: 5978 [2019-12-07 13:43:17,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:43:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2019-12-07 13:43:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 4766. [2019-12-07 13:43:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4766 states. [2019-12-07 13:43:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 13905 transitions. [2019-12-07 13:43:17,075 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 13905 transitions. Word has length 61 [2019-12-07 13:43:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:17,075 INFO L462 AbstractCegarLoop]: Abstraction has 4766 states and 13905 transitions. [2019-12-07 13:43:17,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:43:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 13905 transitions. [2019-12-07 13:43:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:43:17,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:17,081 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] [2019-12-07 13:43:17,081 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash -55127569, now seen corresponding path program 1 times [2019-12-07 13:43:17,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:17,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919695843] [2019-12-07 13:43:17,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:17,122 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 13:43:17,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919695843] [2019-12-07 13:43:17,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:17,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:17,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69417492] [2019-12-07 13:43:17,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:17,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:17,123 INFO L87 Difference]: Start difference. First operand 4766 states and 13905 transitions. Second operand 5 states. [2019-12-07 13:43:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,263 INFO L93 Difference]: Finished difference Result 5392 states and 15574 transitions. [2019-12-07 13:43:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:17,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 13:43:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,269 INFO L225 Difference]: With dead ends: 5392 [2019-12-07 13:43:17,269 INFO L226 Difference]: Without dead ends: 5392 [2019-12-07 13:43:17,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:17,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2019-12-07 13:43:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 5091. [2019-12-07 13:43:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2019-12-07 13:43:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 14846 transitions. [2019-12-07 13:43:17,327 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 14846 transitions. Word has length 62 [2019-12-07 13:43:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:17,327 INFO L462 AbstractCegarLoop]: Abstraction has 5091 states and 14846 transitions. [2019-12-07 13:43:17,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 14846 transitions. [2019-12-07 13:43:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:43:17,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:17,333 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] [2019-12-07 13:43:17,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 190281676, now seen corresponding path program 1 times [2019-12-07 13:43:17,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:17,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651207320] [2019-12-07 13:43:17,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:17,394 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 13:43:17,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651207320] [2019-12-07 13:43:17,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:17,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:43:17,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347946802] [2019-12-07 13:43:17,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:43:17,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:17,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:43:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:17,395 INFO L87 Difference]: Start difference. First operand 5091 states and 14846 transitions. Second operand 7 states. [2019-12-07 13:43:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,600 INFO L93 Difference]: Finished difference Result 5581 states and 16037 transitions. [2019-12-07 13:43:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:43:17,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 13:43:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,605 INFO L225 Difference]: With dead ends: 5581 [2019-12-07 13:43:17,606 INFO L226 Difference]: Without dead ends: 5581 [2019-12-07 13:43:17,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:43:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5581 states. [2019-12-07 13:43:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5581 to 4788. [2019-12-07 13:43:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-07 13:43:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 13964 transitions. [2019-12-07 13:43:17,664 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 13964 transitions. Word has length 62 [2019-12-07 13:43:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:17,664 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 13964 transitions. [2019-12-07 13:43:17,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:43:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 13964 transitions. [2019-12-07 13:43:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:43:17,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:17,671 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] [2019-12-07 13:43:17,671 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1376875847, now seen corresponding path program 1 times [2019-12-07 13:43:17,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:17,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951075333] [2019-12-07 13:43:17,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:17,718 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 13:43:17,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951075333] [2019-12-07 13:43:17,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:17,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:43:17,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561062336] [2019-12-07 13:43:17,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:43:17,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:43:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:43:17,720 INFO L87 Difference]: Start difference. First operand 4788 states and 13964 transitions. Second operand 3 states. [2019-12-07 13:43:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,742 INFO L93 Difference]: Finished difference Result 4788 states and 13963 transitions. [2019-12-07 13:43:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:43:17,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 13:43:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,749 INFO L225 Difference]: With dead ends: 4788 [2019-12-07 13:43:17,749 INFO L226 Difference]: Without dead ends: 4788 [2019-12-07 13:43:17,749 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 13:43:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-07 13:43:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4637. [2019-12-07 13:43:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4637 states. [2019-12-07 13:43:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 13616 transitions. [2019-12-07 13:43:17,808 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 13616 transitions. Word has length 62 [2019-12-07 13:43:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:17,808 INFO L462 AbstractCegarLoop]: Abstraction has 4637 states and 13616 transitions. [2019-12-07 13:43:17,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:43:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 13616 transitions. [2019-12-07 13:43:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:43:17,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:17,814 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] [2019-12-07 13:43:17,814 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1823715194, now seen corresponding path program 1 times [2019-12-07 13:43:17,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:17,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544426608] [2019-12-07 13:43:17,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:17,883 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 13:43:17,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544426608] [2019-12-07 13:43:17,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:17,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:43:17,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959967613] [2019-12-07 13:43:17,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:43:17,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:17,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:43:17,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:43:17,884 INFO L87 Difference]: Start difference. First operand 4637 states and 13616 transitions. Second operand 5 states. [2019-12-07 13:43:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:17,930 INFO L93 Difference]: Finished difference Result 7460 states and 20438 transitions. [2019-12-07 13:43:17,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:43:17,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 13:43:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:17,934 INFO L225 Difference]: With dead ends: 7460 [2019-12-07 13:43:17,934 INFO L226 Difference]: Without dead ends: 3473 [2019-12-07 13:43:17,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:43:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2019-12-07 13:43:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2959. [2019-12-07 13:43:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2019-12-07 13:43:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 7718 transitions. [2019-12-07 13:43:17,965 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 7718 transitions. Word has length 63 [2019-12-07 13:43:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 2959 states and 7718 transitions. [2019-12-07 13:43:17,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:43:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 7718 transitions. [2019-12-07 13:43:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:43:17,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:17,969 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] [2019-12-07 13:43:17,969 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:17,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1053035404, now seen corresponding path program 2 times [2019-12-07 13:43:17,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:17,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109961420] [2019-12-07 13:43:17,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:18,018 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 13:43:18,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109961420] [2019-12-07 13:43:18,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:18,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:43:18,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196531706] [2019-12-07 13:43:18,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:43:18,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:18,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:43:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:43:18,020 INFO L87 Difference]: Start difference. First operand 2959 states and 7718 transitions. Second operand 4 states. [2019-12-07 13:43:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:18,039 INFO L93 Difference]: Finished difference Result 3517 states and 8972 transitions. [2019-12-07 13:43:18,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:43:18,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 13:43:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:18,040 INFO L225 Difference]: With dead ends: 3517 [2019-12-07 13:43:18,040 INFO L226 Difference]: Without dead ends: 636 [2019-12-07 13:43:18,041 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 13:43:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-12-07 13:43:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-12-07 13:43:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 13:43:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1377 transitions. [2019-12-07 13:43:18,046 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1377 transitions. Word has length 63 [2019-12-07 13:43:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:18,046 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1377 transitions. [2019-12-07 13:43:18,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:43:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1377 transitions. [2019-12-07 13:43:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:43:18,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:18,047 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] [2019-12-07 13:43:18,047 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:18,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2126696180, now seen corresponding path program 3 times [2019-12-07 13:43:18,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:18,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296645816] [2019-12-07 13:43:18,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:43:18,121 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 13:43:18,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296645816] [2019-12-07 13:43:18,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:43:18,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:43:18,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802447855] [2019-12-07 13:43:18,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:43:18,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:43:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:43:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:43:18,122 INFO L87 Difference]: Start difference. First operand 636 states and 1377 transitions. Second operand 8 states. [2019-12-07 13:43:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:43:18,309 INFO L93 Difference]: Finished difference Result 1575 states and 3389 transitions. [2019-12-07 13:43:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:43:18,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 13:43:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:43:18,310 INFO L225 Difference]: With dead ends: 1575 [2019-12-07 13:43:18,310 INFO L226 Difference]: Without dead ends: 1292 [2019-12-07 13:43:18,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:43:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-07 13:43:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 719. [2019-12-07 13:43:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-07 13:43:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1556 transitions. [2019-12-07 13:43:18,318 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1556 transitions. Word has length 63 [2019-12-07 13:43:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:43:18,318 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1556 transitions. [2019-12-07 13:43:18,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:43:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1556 transitions. [2019-12-07 13:43:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:43:18,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:43:18,319 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] [2019-12-07 13:43:18,319 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:43:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:43:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 222753420, now seen corresponding path program 4 times [2019-12-07 13:43:18,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:43:18,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401383664] [2019-12-07 13:43:18,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:43:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:43:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:43:18,378 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:43:18,378 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:43:18,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_31| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (= |v_ULTIMATE.start_main_~#t284~0.offset_23| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31|) |v_ULTIMATE.start_main_~#t284~0.offset_23| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31|) 0) (= v_~y~0_37 0) (= v_~z~0_322 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_31|, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:43:18,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:43:18,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-12-07 13:43:18,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:43:18,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out-58738083| |P2Thread1of1ForFork0_#t~ite28_Out-58738083|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-58738083 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-58738083 256) 0))) (or (and (= ~z$w_buff1~0_In-58738083 |P2Thread1of1ForFork0_#t~ite28_Out-58738083|) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-58738083| ~z$w_buff0~0_In-58738083) .cse2 (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-58738083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58738083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-58738083, ~z$w_buff1~0=~z$w_buff1~0_In-58738083} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-58738083|, ~z$w_buff0~0=~z$w_buff0~0_In-58738083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58738083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-58738083, ~z$w_buff1~0=~z$w_buff1~0_In-58738083, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-58738083|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:43:18,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:43:18,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1901205392 256)))) (or (and .cse0 (= ~z~0_In-1901205392 |P2Thread1of1ForFork0_#t~ite48_Out-1901205392|)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1901205392| ~z$mem_tmp~0_In-1901205392) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1901205392, ~z$flush_delayed~0=~z$flush_delayed~0_In-1901205392, ~z~0=~z~0_In-1901205392} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1901205392|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1901205392, ~z$flush_delayed~0=~z$flush_delayed~0_In-1901205392, ~z~0=~z~0_In-1901205392} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:43:18,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:43:18,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In124445890 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In124445890 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out124445890|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In124445890 |P2Thread1of1ForFork0_#t~ite51_Out124445890|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In124445890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124445890} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In124445890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124445890, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out124445890|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 13:43:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1411509713 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1411509713 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1411509713 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1411509713 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1411509713| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out-1411509713| ~z$w_buff1_used~0_In-1411509713) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1411509713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1411509713|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1411509713} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 13:43:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-1107767256 ~z$r_buff0_thd3~0_Out-1107767256)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1107767256 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1107767256 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= ~z$r_buff0_thd3~0_Out-1107767256 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107767256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1107767256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107767256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1107767256, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1107767256|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 13:43:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1897753827 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1897753827 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1897753827 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1897753827 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out1897753827| ~z$r_buff1_thd3~0_In1897753827) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1897753827| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897753827, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1897753827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897753827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897753827} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1897753827, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1897753827|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1897753827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897753827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897753827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 13:43:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:43:18,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In859638705 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out859638705| ~z~0_In859638705)) (and (not .cse0) (= ~z$mem_tmp~0_In859638705 |P1Thread1of1ForFork2_#t~ite25_Out859638705|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In859638705, ~z$flush_delayed~0=~z$flush_delayed~0_In859638705, ~z~0=~z~0_In859638705} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In859638705, ~z$flush_delayed~0=~z$flush_delayed~0_In859638705, ~z~0=~z~0_In859638705, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out859638705|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:43:18,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:43:18,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:43:18,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-455200929 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-455200929| |ULTIMATE.start_main_#t~ite59_Out-455200929|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-455200929 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-455200929| ~z~0_In-455200929)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-455200929| ~z$w_buff1~0_In-455200929)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-455200929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-455200929, ~z$w_buff1~0=~z$w_buff1~0_In-455200929, ~z~0=~z~0_In-455200929} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-455200929, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-455200929|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-455200929, ~z$w_buff1~0=~z$w_buff1~0_In-455200929, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-455200929|, ~z~0=~z~0_In-455200929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:43:18,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In243796212 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In243796212 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In243796212 |ULTIMATE.start_main_#t~ite60_Out243796212|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out243796212|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In243796212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out243796212|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In243796212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:43:18,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In804339716 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In804339716 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In804339716 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In804339716 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In804339716 |ULTIMATE.start_main_#t~ite61_Out804339716|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out804339716|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804339716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804339716, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804339716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804339716} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804339716, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out804339716|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804339716, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804339716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804339716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:43:18,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-989143162 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-989143162 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-989143162| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-989143162| ~z$r_buff0_thd0~0_In-989143162) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-989143162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-989143162} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-989143162|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-989143162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-989143162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:43:18,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In258966936 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In258966936 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In258966936 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In258966936 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In258966936 |ULTIMATE.start_main_#t~ite63_Out258966936|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite63_Out258966936|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258966936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258966936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In258966936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258966936} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out258966936|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258966936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258966936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In258966936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258966936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:43:18,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 13:43:18,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:43:18 BasicIcfg [2019-12-07 13:43:18,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:43:18,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:43:18,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:43:18,459 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:43:18,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:43:00" (3/4) ... [2019-12-07 13:43:18,461 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:43:18,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= 0 v_~z$flush_delayed~0_312) (= v_~z$r_buff0_thd1~0_133 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_369) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~x~0_59 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_31| 4) |v_#length_23|) (= v_~main$tmp_guard1~0_30 0) (= v_~z$w_buff0~0_407 0) (= v_~z$r_buff1_thd0~0_262 0) (= v_~z$r_buff1_thd1~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_53) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$mem_tmp~0_246) (= v_~z$r_buff1_thd2~0_361 0) (= |v_ULTIMATE.start_main_~#t284~0.offset_23| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_953 0) (= v_~z$r_buff0_thd0~0_190 0) (= v_~a~0_20 0) (= v_~weak$$choice2~0_312 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~z$r_buff0_thd3~0_586) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff1~0_282 0) (= v_~z$w_buff1_used~0_540 0) (= v_~z$r_buff0_thd2~0_401 0) (= 0 v_~weak$$choice0~0_233) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_31|) |v_ULTIMATE.start_main_~#t284~0.offset_23| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_32 0) (= v_~__unbuffered_cnt~0_150 0) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_31|) 0) (= v_~y~0_37 0) (= v_~z~0_322 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_31|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_361, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_246, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_58|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_540, ~z$flush_delayed~0=v_~z$flush_delayed~0_312, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_233, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_201, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_586, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_31|, ~x~0=v_~x~0_59, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_282, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_262, ~y~0=v_~y~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_953, ~z$w_buff0~0=v_~z$w_buff0~0_407, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_369, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_73|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_446|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_322, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_133} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:43:18,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:43:18,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-12-07 13:43:18,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~z$w_buff0~0_55 v_~z$w_buff1~0_45) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_17) (= v_~z$w_buff0_used~0_158 v_~z$w_buff1_used~0_82) (= 1 v_~z$w_buff0~0_54) (= v_~z$w_buff0_used~0_157 1) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_157 256))) (not (= (mod v_~z$w_buff1_used~0_82 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_158, ~z$w_buff0~0=v_~z$w_buff0~0_55, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_157, ~z$w_buff0~0=v_~z$w_buff0~0_54, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$w_buff1~0=v_~z$w_buff1~0_45, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 13:43:18,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite29_Out-58738083| |P2Thread1of1ForFork0_#t~ite28_Out-58738083|)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-58738083 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-58738083 256) 0))) (or (and (= ~z$w_buff1~0_In-58738083 |P2Thread1of1ForFork0_#t~ite28_Out-58738083|) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-58738083| ~z$w_buff0~0_In-58738083) .cse2 (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-58738083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58738083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-58738083, ~z$w_buff1~0=~z$w_buff1~0_In-58738083} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-58738083|, ~z$w_buff0~0=~z$w_buff0~0_In-58738083, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58738083, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-58738083, ~z$w_buff1~0=~z$w_buff1~0_In-58738083, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-58738083|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:43:18,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_95 v_~z$r_buff0_thd3~0_94) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_94, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:43:18,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1901205392 256)))) (or (and .cse0 (= ~z~0_In-1901205392 |P2Thread1of1ForFork0_#t~ite48_Out-1901205392|)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-1901205392| ~z$mem_tmp~0_In-1901205392) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1901205392, ~z$flush_delayed~0=~z$flush_delayed~0_In-1901205392, ~z~0=~z~0_In-1901205392} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1901205392|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1901205392, ~z$flush_delayed~0=~z$flush_delayed~0_In-1901205392, ~z~0=~z~0_In-1901205392} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:43:18,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_36 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~a~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{~a~0=v_~a~0_13, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:43:18,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In124445890 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In124445890 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out124445890|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In124445890 |P2Thread1of1ForFork0_#t~ite51_Out124445890|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In124445890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124445890} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In124445890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In124445890, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out124445890|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 13:43:18,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1411509713 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1411509713 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1411509713 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1411509713 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1411509713| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out-1411509713| ~z$w_buff1_used~0_In-1411509713) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1411509713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1411509713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1411509713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411509713, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1411509713|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1411509713} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 13:43:18,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-1107767256 ~z$r_buff0_thd3~0_Out-1107767256)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1107767256 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1107767256 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= ~z$r_buff0_thd3~0_Out-1107767256 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107767256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1107767256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107767256, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1107767256, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1107767256|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 13:43:18,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1897753827 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1897753827 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1897753827 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1897753827 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out1897753827| ~z$r_buff1_thd3~0_In1897753827) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out1897753827| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1897753827, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1897753827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897753827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897753827} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1897753827, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1897753827|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1897753827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1897753827, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1897753827} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 13:43:18,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_301 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:43:18,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In859638705 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out859638705| ~z~0_In859638705)) (and (not .cse0) (= ~z$mem_tmp~0_In859638705 |P1Thread1of1ForFork2_#t~ite25_Out859638705|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In859638705, ~z$flush_delayed~0=~z$flush_delayed~0_In859638705, ~z~0=~z~0_In859638705} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In859638705, ~z$flush_delayed~0=~z$flush_delayed~0_In859638705, ~z~0=~z~0_In859638705, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out859638705|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:43:18,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= 0 v_~z$flush_delayed~0_126) (= v_~z~0_145 |v_P1Thread1of1ForFork2_#t~ite25_56|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_56|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, ~z~0=v_~z~0_145, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_55|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:43:18,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_18 256)) (= 0 (mod v_~z$w_buff0_used~0_136 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:43:18,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-455200929 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-455200929| |ULTIMATE.start_main_#t~ite59_Out-455200929|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-455200929 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-455200929| ~z~0_In-455200929)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-455200929| ~z$w_buff1~0_In-455200929)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-455200929, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-455200929, ~z$w_buff1~0=~z$w_buff1~0_In-455200929, ~z~0=~z~0_In-455200929} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-455200929, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-455200929|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-455200929, ~z$w_buff1~0=~z$w_buff1~0_In-455200929, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-455200929|, ~z~0=~z~0_In-455200929} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:43:18,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In243796212 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In243796212 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In243796212 |ULTIMATE.start_main_#t~ite60_Out243796212|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out243796212|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In243796212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out243796212|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In243796212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In243796212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:43:18,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In804339716 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In804339716 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In804339716 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In804339716 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In804339716 |ULTIMATE.start_main_#t~ite61_Out804339716|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out804339716|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804339716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804339716, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804339716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804339716} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In804339716, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out804339716|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In804339716, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In804339716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In804339716} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:43:18,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-989143162 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-989143162 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-989143162| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out-989143162| ~z$r_buff0_thd0~0_In-989143162) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-989143162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-989143162} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-989143162|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-989143162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-989143162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:43:18,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In258966936 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In258966936 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In258966936 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In258966936 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In258966936 |ULTIMATE.start_main_#t~ite63_Out258966936|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite63_Out258966936|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258966936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258966936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In258966936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258966936} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out258966936|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258966936, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258966936, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In258966936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In258966936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:43:18,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_249 |v_ULTIMATE.start_main_#t~ite63_36|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~x~0_50 2) (= v_~__unbuffered_p1_EBX~0_20 0) (= v_~__unbuffered_p2_EBX~0_21 0) (= 1 v_~__unbuffered_p1_EAX~0_44))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~x~0=v_~x~0_50, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, 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 13:43:18,536 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8024ac9a-e3c6-4fd7-bf26-b65912060ec2/bin/uautomizer/witness.graphml [2019-12-07 13:43:18,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:43:18,537 INFO L168 Benchmark]: Toolchain (without parser) took 18556.04 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 934.0 MB in the beginning and 761.7 MB in the end (delta: 172.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 13:43:18,537 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:43:18,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:18,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.56 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 13:43:18,538 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 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 13:43:18,538 INFO L168 Benchmark]: RCFGBuilder took 447.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.3 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:18,539 INFO L168 Benchmark]: TraceAbstraction took 17569.42 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 998.3 MB in the beginning and 820.1 MB in the end (delta: 178.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:43:18,539 INFO L168 Benchmark]: Witness Printer took 77.44 ms. Allocated memory is still 2.3 GB. Free memory was 820.1 MB in the beginning and 761.7 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:43:18,540 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.56 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. * Boogie Preprocessor took 28.97 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. * RCFGBuilder took 447.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.3 MB in the end (delta: 60.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17569.42 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 998.3 MB in the beginning and 820.1 MB in the end (delta: 178.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 77.44 ms. Allocated memory is still 2.3 GB. Free memory was 820.1 MB in the beginning and 761.7 MB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 196 ProgramPointsBefore, 103 ProgramPointsAfterwards, 242 TransitionsBefore, 122 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 31 ChoiceCompositions, 9041 VarBasedMoverChecksPositive, 312 VarBasedMoverChecksNegative, 82 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 115591 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=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] [L840] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=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] [L842] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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=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] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L800] 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) [L801] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L801] 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)) [L802] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L802] 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)) [L803] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L803] 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)) [L804] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L804] 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)) [L806] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L806] 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)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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 = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L815] 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) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 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 [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, 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=1, 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] [L848] 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) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 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 [L851] 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, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3589 SDtfs, 4539 SDslu, 6650 SDs, 0 SdLazy, 2467 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61466occurred 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: 5.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 17116 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 769 ConstructedInterpolants, 0 QuantifiedInterpolants, 209051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...