./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007_rmo.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_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/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 4df0cab6238e26cd777f0c7fb90f26c112af76a8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:03:43,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:03:43,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:03:43,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:03:43,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:03:43,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:03:43,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:03:43,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:03:43,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:03:43,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:03:43,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:03:43,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:03:43,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:03:43,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:03:43,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:03:43,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:03:43,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:03:43,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:03:43,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:03:43,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:03:43,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:03:43,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:03:43,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:03:43,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:03:43,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:03:43,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:03:43,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:03:43,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:03:43,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:03:43,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:03:43,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:03:43,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:03:43,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:03:43,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:03:43,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:03:43,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:03:43,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:03:43,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:03:43,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:03:43,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:03:43,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:03:43,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:03:43,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:03:43,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:03:43,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:03:43,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:03:43,529 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:03:43,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:03:43,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:03:43,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:03:43,531 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:03:43,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:03:43,531 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:03:43,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:03:43,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:03:43,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:03:43,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:03:43,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:03:43,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:03:43,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:03:43,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:03:43,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:03:43,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:03:43,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:03:43,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:03:43,534 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:03:43,534 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_6fa02d23-16e9-4f85-93e4-33666f970247/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 -> 4df0cab6238e26cd777f0c7fb90f26c112af76a8 [2019-12-07 14:03:43,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:03:43,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:03:43,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:03:43,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:03:43,677 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:03:43,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix007_rmo.opt.i [2019-12-07 14:03:43,721 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/data/0f4f1b079/036c2882782e490b8296006325f2c1c2/FLAGfc7dbdae7 [2019-12-07 14:03:44,079 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:03:44,079 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/sv-benchmarks/c/pthread-wmm/mix007_rmo.opt.i [2019-12-07 14:03:44,089 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/data/0f4f1b079/036c2882782e490b8296006325f2c1c2/FLAGfc7dbdae7 [2019-12-07 14:03:44,098 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/data/0f4f1b079/036c2882782e490b8296006325f2c1c2 [2019-12-07 14:03:44,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:03:44,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:03:44,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:03:44,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:03:44,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:03:44,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44, skipping insertion in model container [2019-12-07 14:03:44,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:03:44,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:03:44,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:03:44,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:03:44,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:03:44,497 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:03:44,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44 WrapperNode [2019-12-07 14:03:44,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:03:44,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:03:44,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:03:44,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:03:44,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:03:44,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:03:44,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:03:44,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:03:44,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... [2019-12-07 14:03:44,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:03:44,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:03:44,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:03:44,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:03:44,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/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 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:03:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:03:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:03:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:03:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:03:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:03:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 14:03:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 14:03:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:03:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:03:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:03:44,620 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 14:03:45,034 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:03:45,034 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:03:45,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:03:45 BoogieIcfgContainer [2019-12-07 14:03:45,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:03:45,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:03:45,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:03:45,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:03:45,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:03:44" (1/3) ... [2019-12-07 14:03:45,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a86d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:03:45, skipping insertion in model container [2019-12-07 14:03:45,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:03:44" (2/3) ... [2019-12-07 14:03:45,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a86d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:03:45, skipping insertion in model container [2019-12-07 14:03:45,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:03:45" (3/3) ... [2019-12-07 14:03:45,041 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_rmo.opt.i [2019-12-07 14:03:45,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:03:45,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:03:45,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:03:45,053 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:03:45,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,081 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,094 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,094 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,096 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,097 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,098 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,099 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,100 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,101 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,102 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,103 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:03:45,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 14:03:45,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:03:45,135 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:03:45,135 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:03:45,135 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:03:45,135 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:03:45,135 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:03:45,135 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:03:45,135 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:03:45,147 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 14:03:45,149 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 14:03:45,224 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 14:03:45,224 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:03:45,236 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:03:45,258 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 14:03:45,298 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 14:03:45,298 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:03:45,307 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 14:03:45,333 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 14:03:45,334 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:03:48,908 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 14:03:49,163 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 14:03:49,284 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 14:03:49,284 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 14:03:49,286 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 14:03:56,413 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 14:03:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 14:03:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 14:03:56,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:03:56,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:03:56,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:03:56,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:03:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 14:03:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:03:56,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157791318] [2019-12-07 14:03:56,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:03:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:03:56,581 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 14:03:56,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157791318] [2019-12-07 14:03:56,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:03:56,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:03:56,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124299516] [2019-12-07 14:03:56,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:03:56,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:03:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:03:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:03:56,596 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 14:03:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:03:57,330 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 14:03:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:03:57,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 14:03:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:03:57,779 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 14:03:57,779 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 14:03:57,780 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 14:03:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 14:04:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 14:04:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 14:04:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 14:04:00,500 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 14:04:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:00,501 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 14:04:00,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 14:04:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 14:04:00,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:00,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:00,510 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 14:04:00,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:00,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938976428] [2019-12-07 14:04:00,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:00,581 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 14:04:00,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938976428] [2019-12-07 14:04:00,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:00,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:00,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624454078] [2019-12-07 14:04:00,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:00,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:00,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:00,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:00,583 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 14:04:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:02,675 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 14:04:02,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:02,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 14:04:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:03,094 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 14:04:03,095 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 14:04:03,095 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 14:04:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 14:04:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 14:04:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 14:04:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 14:04:06,538 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 14:04:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:06,538 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 14:04:06,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 14:04:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:04:06,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:06,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:06,544 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 14:04:06,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:06,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574348982] [2019-12-07 14:04:06,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:06,588 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 14:04:06,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574348982] [2019-12-07 14:04:06,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:06,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:06,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199585873] [2019-12-07 14:04:06,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:06,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:06,589 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 14:04:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:07,701 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 14:04:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:07,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:04:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:08,130 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 14:04:08,130 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 14:04:08,130 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 14:04:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 14:04:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 14:04:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 14:04:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 14:04:13,938 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 14:04:13,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:13,938 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 14:04:13,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 14:04:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:04:13,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:13,953 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 14:04:13,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 14:04:13,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:13,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882429518] [2019-12-07 14:04:13,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:14,015 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 14:04:14,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882429518] [2019-12-07 14:04:14,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:14,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:14,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686703870] [2019-12-07 14:04:14,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:04:14,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:04:14,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:04:14,016 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 14:04:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:14,654 INFO L93 Difference]: Finished difference Result 141658 states and 623292 transitions. [2019-12-07 14:04:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:04:14,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 14:04:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:15,036 INFO L225 Difference]: With dead ends: 141658 [2019-12-07 14:04:15,036 INFO L226 Difference]: Without dead ends: 141658 [2019-12-07 14:04:15,036 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 14:04:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141658 states. [2019-12-07 14:04:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141658 to 141210. [2019-12-07 14:04:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141210 states. [2019-12-07 14:04:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141210 states to 141210 states and 621644 transitions. [2019-12-07 14:04:20,931 INFO L78 Accepts]: Start accepts. Automaton has 141210 states and 621644 transitions. Word has length 20 [2019-12-07 14:04:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:20,931 INFO L462 AbstractCegarLoop]: Abstraction has 141210 states and 621644 transitions. [2019-12-07 14:04:20,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:04:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 141210 states and 621644 transitions. [2019-12-07 14:04:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:04:20,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:20,939 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 14:04:20,939 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:20,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1362298761, now seen corresponding path program 1 times [2019-12-07 14:04:20,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:20,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680804897] [2019-12-07 14:04:20,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:20,988 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 14:04:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680804897] [2019-12-07 14:04:20,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:20,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:20,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713581807] [2019-12-07 14:04:20,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:20,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:20,989 INFO L87 Difference]: Start difference. First operand 141210 states and 621644 transitions. Second operand 4 states. [2019-12-07 14:04:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:21,500 INFO L93 Difference]: Finished difference Result 117572 states and 477168 transitions. [2019-12-07 14:04:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:21,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 14:04:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:21,772 INFO L225 Difference]: With dead ends: 117572 [2019-12-07 14:04:21,772 INFO L226 Difference]: Without dead ends: 109256 [2019-12-07 14:04:21,772 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 14:04:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109256 states. [2019-12-07 14:04:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109256 to 109256. [2019-12-07 14:04:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109256 states. [2019-12-07 14:04:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109256 states to 109256 states and 445830 transitions. [2019-12-07 14:04:24,598 INFO L78 Accepts]: Start accepts. Automaton has 109256 states and 445830 transitions. Word has length 20 [2019-12-07 14:04:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:24,599 INFO L462 AbstractCegarLoop]: Abstraction has 109256 states and 445830 transitions. [2019-12-07 14:04:24,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109256 states and 445830 transitions. [2019-12-07 14:04:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 14:04:24,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:24,605 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] [2019-12-07 14:04:24,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash 695884557, now seen corresponding path program 1 times [2019-12-07 14:04:24,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:24,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039212738] [2019-12-07 14:04:24,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:24,684 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 14:04:24,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039212738] [2019-12-07 14:04:24,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:24,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:24,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287774040] [2019-12-07 14:04:24,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:24,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:24,686 INFO L87 Difference]: Start difference. First operand 109256 states and 445830 transitions. Second operand 4 states. [2019-12-07 14:04:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:25,704 INFO L93 Difference]: Finished difference Result 173435 states and 691174 transitions. [2019-12-07 14:04:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:25,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 14:04:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:26,104 INFO L225 Difference]: With dead ends: 173435 [2019-12-07 14:04:26,104 INFO L226 Difference]: Without dead ends: 172961 [2019-12-07 14:04:26,104 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 14:04:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172961 states. [2019-12-07 14:04:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172961 to 169865. [2019-12-07 14:04:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169865 states. [2019-12-07 14:04:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169865 states to 169865 states and 681882 transitions. [2019-12-07 14:04:30,288 INFO L78 Accepts]: Start accepts. Automaton has 169865 states and 681882 transitions. Word has length 21 [2019-12-07 14:04:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:30,288 INFO L462 AbstractCegarLoop]: Abstraction has 169865 states and 681882 transitions. [2019-12-07 14:04:30,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 169865 states and 681882 transitions. [2019-12-07 14:04:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:04:30,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:30,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:30,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash 556520531, now seen corresponding path program 1 times [2019-12-07 14:04:30,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:30,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911137869] [2019-12-07 14:04:30,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:30,364 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 14:04:30,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911137869] [2019-12-07 14:04:30,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:30,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:04:30,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869541530] [2019-12-07 14:04:30,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:30,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:30,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:30,365 INFO L87 Difference]: Start difference. First operand 169865 states and 681882 transitions. Second operand 4 states. [2019-12-07 14:04:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:31,479 INFO L93 Difference]: Finished difference Result 164672 states and 658149 transitions. [2019-12-07 14:04:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:31,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 14:04:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:31,842 INFO L225 Difference]: With dead ends: 164672 [2019-12-07 14:04:31,842 INFO L226 Difference]: Without dead ends: 164672 [2019-12-07 14:04:31,843 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 14:04:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164672 states. [2019-12-07 14:04:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164672 to 119962. [2019-12-07 14:04:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119962 states. [2019-12-07 14:04:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119962 states to 119962 states and 480911 transitions. [2019-12-07 14:04:37,709 INFO L78 Accepts]: Start accepts. Automaton has 119962 states and 480911 transitions. Word has length 22 [2019-12-07 14:04:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:37,710 INFO L462 AbstractCegarLoop]: Abstraction has 119962 states and 480911 transitions. [2019-12-07 14:04:37,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 119962 states and 480911 transitions. [2019-12-07 14:04:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:04:37,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:37,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:04:37,726 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1096679272, now seen corresponding path program 1 times [2019-12-07 14:04:37,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:37,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640933847] [2019-12-07 14:04:37,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:37,761 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 14:04:37,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640933847] [2019-12-07 14:04:37,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:37,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:37,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793581874] [2019-12-07 14:04:37,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:37,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:37,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:37,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:37,762 INFO L87 Difference]: Start difference. First operand 119962 states and 480911 transitions. Second operand 5 states. [2019-12-07 14:04:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:38,659 INFO L93 Difference]: Finished difference Result 144276 states and 570909 transitions. [2019-12-07 14:04:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:04:38,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:04:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:38,992 INFO L225 Difference]: With dead ends: 144276 [2019-12-07 14:04:38,992 INFO L226 Difference]: Without dead ends: 144191 [2019-12-07 14:04:38,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144191 states. [2019-12-07 14:04:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144191 to 120256. [2019-12-07 14:04:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120256 states. [2019-12-07 14:04:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120256 states to 120256 states and 482041 transitions. [2019-12-07 14:04:42,167 INFO L78 Accepts]: Start accepts. Automaton has 120256 states and 482041 transitions. Word has length 25 [2019-12-07 14:04:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:42,167 INFO L462 AbstractCegarLoop]: Abstraction has 120256 states and 482041 transitions. [2019-12-07 14:04:42,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 120256 states and 482041 transitions. [2019-12-07 14:04:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 14:04:42,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:42,271 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 14:04:42,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 590197647, now seen corresponding path program 1 times [2019-12-07 14:04:42,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:42,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223510248] [2019-12-07 14:04:42,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:42,336 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 14:04:42,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223510248] [2019-12-07 14:04:42,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:42,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:04:42,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266772417] [2019-12-07 14:04:42,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:42,339 INFO L87 Difference]: Start difference. First operand 120256 states and 482041 transitions. Second operand 4 states. [2019-12-07 14:04:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:43,077 INFO L93 Difference]: Finished difference Result 183925 states and 729131 transitions. [2019-12-07 14:04:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:43,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 14:04:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:43,318 INFO L225 Difference]: With dead ends: 183925 [2019-12-07 14:04:43,318 INFO L226 Difference]: Without dead ends: 104234 [2019-12-07 14:04:43,318 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 14:04:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104234 states. [2019-12-07 14:04:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104234 to 102865. [2019-12-07 14:04:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102865 states. [2019-12-07 14:04:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102865 states to 102865 states and 384117 transitions. [2019-12-07 14:04:46,044 INFO L78 Accepts]: Start accepts. Automaton has 102865 states and 384117 transitions. Word has length 36 [2019-12-07 14:04:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:46,045 INFO L462 AbstractCegarLoop]: Abstraction has 102865 states and 384117 transitions. [2019-12-07 14:04:46,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 102865 states and 384117 transitions. [2019-12-07 14:04:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:04:46,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:46,134 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] [2019-12-07 14:04:46,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1265576290, now seen corresponding path program 1 times [2019-12-07 14:04:46,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:46,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547634001] [2019-12-07 14:04:46,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:46,221 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 14:04:46,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547634001] [2019-12-07 14:04:46,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:46,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:04:46,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246177034] [2019-12-07 14:04:46,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:04:46,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:04:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:04:46,222 INFO L87 Difference]: Start difference. First operand 102865 states and 384117 transitions. Second operand 9 states. [2019-12-07 14:04:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:47,495 INFO L93 Difference]: Finished difference Result 222400 states and 832256 transitions. [2019-12-07 14:04:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 14:04:47,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-07 14:04:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:48,209 INFO L225 Difference]: With dead ends: 222400 [2019-12-07 14:04:48,210 INFO L226 Difference]: Without dead ends: 184005 [2019-12-07 14:04:48,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-12-07 14:04:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184005 states. [2019-12-07 14:04:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184005 to 150663. [2019-12-07 14:04:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150663 states. [2019-12-07 14:04:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150663 states to 150663 states and 571916 transitions. [2019-12-07 14:04:52,029 INFO L78 Accepts]: Start accepts. Automaton has 150663 states and 571916 transitions. Word has length 37 [2019-12-07 14:04:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:52,029 INFO L462 AbstractCegarLoop]: Abstraction has 150663 states and 571916 transitions. [2019-12-07 14:04:52,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:04:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 150663 states and 571916 transitions. [2019-12-07 14:04:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:04:52,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:52,160 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] [2019-12-07 14:04:52,160 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:52,161 INFO L82 PathProgramCache]: Analyzing trace with hash -395811136, now seen corresponding path program 2 times [2019-12-07 14:04:52,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:52,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680222272] [2019-12-07 14:04:52,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:52,218 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 14:04:52,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680222272] [2019-12-07 14:04:52,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:52,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:52,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183825994] [2019-12-07 14:04:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:04:52,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:04:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:04:52,219 INFO L87 Difference]: Start difference. First operand 150663 states and 571916 transitions. Second operand 5 states. [2019-12-07 14:04:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:52,489 INFO L93 Difference]: Finished difference Result 69450 states and 237572 transitions. [2019-12-07 14:04:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:04:52,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 14:04:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:52,593 INFO L225 Difference]: With dead ends: 69450 [2019-12-07 14:04:52,593 INFO L226 Difference]: Without dead ends: 60540 [2019-12-07 14:04:52,594 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 14:04:52,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60540 states. [2019-12-07 14:04:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60540 to 60540. [2019-12-07 14:04:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60540 states. [2019-12-07 14:04:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60540 states to 60540 states and 205761 transitions. [2019-12-07 14:04:53,727 INFO L78 Accepts]: Start accepts. Automaton has 60540 states and 205761 transitions. Word has length 37 [2019-12-07 14:04:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:53,727 INFO L462 AbstractCegarLoop]: Abstraction has 60540 states and 205761 transitions. [2019-12-07 14:04:53,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:04:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 60540 states and 205761 transitions. [2019-12-07 14:04:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:04:53,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:53,773 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] [2019-12-07 14:04:53,773 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1583678927, now seen corresponding path program 1 times [2019-12-07 14:04:53,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:53,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495250550] [2019-12-07 14:04:53,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:53,903 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 14:04:53,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495250550] [2019-12-07 14:04:53,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:53,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:04:53,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592421130] [2019-12-07 14:04:53,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:04:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:04:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:04:53,904 INFO L87 Difference]: Start difference. First operand 60540 states and 205761 transitions. Second operand 10 states. [2019-12-07 14:04:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:55,228 INFO L93 Difference]: Finished difference Result 92995 states and 319045 transitions. [2019-12-07 14:04:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 14:04:55,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-07 14:04:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:55,382 INFO L225 Difference]: With dead ends: 92995 [2019-12-07 14:04:55,382 INFO L226 Difference]: Without dead ends: 92995 [2019-12-07 14:04:55,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 14:04:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92995 states. [2019-12-07 14:04:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92995 to 67656. [2019-12-07 14:04:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67656 states. [2019-12-07 14:04:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67656 states to 67656 states and 231941 transitions. [2019-12-07 14:04:56,884 INFO L78 Accepts]: Start accepts. Automaton has 67656 states and 231941 transitions. Word has length 38 [2019-12-07 14:04:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:56,884 INFO L462 AbstractCegarLoop]: Abstraction has 67656 states and 231941 transitions. [2019-12-07 14:04:56,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:04:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 67656 states and 231941 transitions. [2019-12-07 14:04:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:04:56,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:56,935 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] [2019-12-07 14:04:56,935 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1266404269, now seen corresponding path program 2 times [2019-12-07 14:04:56,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:56,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616449302] [2019-12-07 14:04:56,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:56,987 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 14:04:56,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616449302] [2019-12-07 14:04:56,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:56,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:04:56,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994958011] [2019-12-07 14:04:56,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:04:56,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:56,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:04:56,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:04:56,989 INFO L87 Difference]: Start difference. First operand 67656 states and 231941 transitions. Second operand 4 states. [2019-12-07 14:04:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:57,292 INFO L93 Difference]: Finished difference Result 61526 states and 205773 transitions. [2019-12-07 14:04:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:04:57,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-07 14:04:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:57,393 INFO L225 Difference]: With dead ends: 61526 [2019-12-07 14:04:57,393 INFO L226 Difference]: Without dead ends: 61526 [2019-12-07 14:04:57,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 14:04:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61526 states. [2019-12-07 14:04:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61526 to 60206. [2019-12-07 14:04:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60206 states. [2019-12-07 14:04:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60206 states to 60206 states and 201645 transitions. [2019-12-07 14:04:58,621 INFO L78 Accepts]: Start accepts. Automaton has 60206 states and 201645 transitions. Word has length 38 [2019-12-07 14:04:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:04:58,622 INFO L462 AbstractCegarLoop]: Abstraction has 60206 states and 201645 transitions. [2019-12-07 14:04:58,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:04:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60206 states and 201645 transitions. [2019-12-07 14:04:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:04:58,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:04:58,665 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] [2019-12-07 14:04:58,665 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:04:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:04:58,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1315911573, now seen corresponding path program 3 times [2019-12-07 14:04:58,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:04:58,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775554500] [2019-12-07 14:04:58,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:04:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:04:58,735 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 14:04:58,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775554500] [2019-12-07 14:04:58,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:04:58,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:04:58,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19392122] [2019-12-07 14:04:58,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:04:58,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:04:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:04:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:04:58,736 INFO L87 Difference]: Start difference. First operand 60206 states and 201645 transitions. Second operand 6 states. [2019-12-07 14:04:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:04:59,331 INFO L93 Difference]: Finished difference Result 86197 states and 288290 transitions. [2019-12-07 14:04:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:04:59,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 14:04:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:04:59,473 INFO L225 Difference]: With dead ends: 86197 [2019-12-07 14:04:59,473 INFO L226 Difference]: Without dead ends: 86197 [2019-12-07 14:04:59,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86197 states. [2019-12-07 14:05:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86197 to 72403. [2019-12-07 14:05:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72403 states. [2019-12-07 14:05:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72403 states to 72403 states and 243698 transitions. [2019-12-07 14:05:01,214 INFO L78 Accepts]: Start accepts. Automaton has 72403 states and 243698 transitions. Word has length 38 [2019-12-07 14:05:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:01,214 INFO L462 AbstractCegarLoop]: Abstraction has 72403 states and 243698 transitions. [2019-12-07 14:05:01,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:05:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 72403 states and 243698 transitions. [2019-12-07 14:05:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:05:01,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:01,262 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] [2019-12-07 14:05:01,262 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1747888809, now seen corresponding path program 4 times [2019-12-07 14:05:01,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:01,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456801887] [2019-12-07 14:05:01,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:01,377 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 14:05:01,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456801887] [2019-12-07 14:05:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:05:01,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852082488] [2019-12-07 14:05:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:05:01,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:05:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:05:01,378 INFO L87 Difference]: Start difference. First operand 72403 states and 243698 transitions. Second operand 8 states. [2019-12-07 14:05:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:01,960 INFO L93 Difference]: Finished difference Result 99394 states and 336737 transitions. [2019-12-07 14:05:01,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:05:01,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-07 14:05:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:02,124 INFO L225 Difference]: With dead ends: 99394 [2019-12-07 14:05:02,124 INFO L226 Difference]: Without dead ends: 95003 [2019-12-07 14:05:02,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:05:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95003 states. [2019-12-07 14:05:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95003 to 73475. [2019-12-07 14:05:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73475 states. [2019-12-07 14:05:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73475 states to 73475 states and 247396 transitions. [2019-12-07 14:05:03,707 INFO L78 Accepts]: Start accepts. Automaton has 73475 states and 247396 transitions. Word has length 38 [2019-12-07 14:05:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:03,708 INFO L462 AbstractCegarLoop]: Abstraction has 73475 states and 247396 transitions. [2019-12-07 14:05:03,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:05:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 73475 states and 247396 transitions. [2019-12-07 14:05:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:05:03,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:03,762 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] [2019-12-07 14:05:03,762 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash 148633297, now seen corresponding path program 5 times [2019-12-07 14:05:03,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:03,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346393211] [2019-12-07 14:05:03,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:03,810 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 14:05:03,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346393211] [2019-12-07 14:05:03,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:03,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:05:03,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652358595] [2019-12-07 14:05:03,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:05:03,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:05:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:05:03,811 INFO L87 Difference]: Start difference. First operand 73475 states and 247396 transitions. Second operand 6 states. [2019-12-07 14:05:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:03,887 INFO L93 Difference]: Finished difference Result 14165 states and 41974 transitions. [2019-12-07 14:05:03,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:05:03,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 14:05:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:03,900 INFO L225 Difference]: With dead ends: 14165 [2019-12-07 14:05:03,900 INFO L226 Difference]: Without dead ends: 11509 [2019-12-07 14:05:03,900 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 14:05:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11509 states. [2019-12-07 14:05:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11509 to 11389. [2019-12-07 14:05:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11389 states. [2019-12-07 14:05:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11389 states to 11389 states and 32744 transitions. [2019-12-07 14:05:04,027 INFO L78 Accepts]: Start accepts. Automaton has 11389 states and 32744 transitions. Word has length 38 [2019-12-07 14:05:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,027 INFO L462 AbstractCegarLoop]: Abstraction has 11389 states and 32744 transitions. [2019-12-07 14:05:04,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:05:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11389 states and 32744 transitions. [2019-12-07 14:05:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:05:04,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,035 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] [2019-12-07 14:05:04,035 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-07 14:05:04,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710938123] [2019-12-07 14:05:04,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,101 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 14:05:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710938123] [2019-12-07 14:05:04,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:04,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005171038] [2019-12-07 14:05:04,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:04,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:04,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:04,102 INFO L87 Difference]: Start difference. First operand 11389 states and 32744 transitions. Second operand 4 states. [2019-12-07 14:05:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:04,188 INFO L93 Difference]: Finished difference Result 13188 states and 36832 transitions. [2019-12-07 14:05:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:05:04,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 14:05:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,203 INFO L225 Difference]: With dead ends: 13188 [2019-12-07 14:05:04,203 INFO L226 Difference]: Without dead ends: 12695 [2019-12-07 14:05:04,203 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 14:05:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12695 states. [2019-12-07 14:05:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12695 to 12100. [2019-12-07 14:05:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12100 states. [2019-12-07 14:05:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12100 states to 12100 states and 34124 transitions. [2019-12-07 14:05:04,371 INFO L78 Accepts]: Start accepts. Automaton has 12100 states and 34124 transitions. Word has length 50 [2019-12-07 14:05:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,371 INFO L462 AbstractCegarLoop]: Abstraction has 12100 states and 34124 transitions. [2019-12-07 14:05:04,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 12100 states and 34124 transitions. [2019-12-07 14:05:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:05:04,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,380 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] [2019-12-07 14:05:04,381 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293106, now seen corresponding path program 2 times [2019-12-07 14:05:04,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588861044] [2019-12-07 14:05:04,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,417 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 14:05:04,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588861044] [2019-12-07 14:05:04,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:04,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252568662] [2019-12-07 14:05:04,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:04,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:04,419 INFO L87 Difference]: Start difference. First operand 12100 states and 34124 transitions. Second operand 4 states. [2019-12-07 14:05:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:04,460 INFO L93 Difference]: Finished difference Result 13585 states and 37502 transitions. [2019-12-07 14:05:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:05:04,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 14:05:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,470 INFO L225 Difference]: With dead ends: 13585 [2019-12-07 14:05:04,470 INFO L226 Difference]: Without dead ends: 9593 [2019-12-07 14:05:04,471 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 14:05:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2019-12-07 14:05:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 9580. [2019-12-07 14:05:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9580 states. [2019-12-07 14:05:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9580 states to 9580 states and 26231 transitions. [2019-12-07 14:05:04,582 INFO L78 Accepts]: Start accepts. Automaton has 9580 states and 26231 transitions. Word has length 50 [2019-12-07 14:05:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,582 INFO L462 AbstractCegarLoop]: Abstraction has 9580 states and 26231 transitions. [2019-12-07 14:05:04,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9580 states and 26231 transitions. [2019-12-07 14:05:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:05:04,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,590 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] [2019-12-07 14:05:04,590 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 101485776, now seen corresponding path program 3 times [2019-12-07 14:05:04,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066545755] [2019-12-07 14:05:04,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,621 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 14:05:04,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066545755] [2019-12-07 14:05:04,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:05:04,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562049576] [2019-12-07 14:05:04,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:05:04,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:05:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:05:04,622 INFO L87 Difference]: Start difference. First operand 9580 states and 26231 transitions. Second operand 4 states. [2019-12-07 14:05:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:04,662 INFO L93 Difference]: Finished difference Result 13385 states and 35301 transitions. [2019-12-07 14:05:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:05:04,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 14:05:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,670 INFO L225 Difference]: With dead ends: 13385 [2019-12-07 14:05:04,670 INFO L226 Difference]: Without dead ends: 9292 [2019-12-07 14:05:04,670 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 14:05:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9292 states. [2019-12-07 14:05:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9292 to 9231. [2019-12-07 14:05:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9231 states. [2019-12-07 14:05:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9231 states to 9231 states and 23011 transitions. [2019-12-07 14:05:04,766 INFO L78 Accepts]: Start accepts. Automaton has 9231 states and 23011 transitions. Word has length 50 [2019-12-07 14:05:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,766 INFO L462 AbstractCegarLoop]: Abstraction has 9231 states and 23011 transitions. [2019-12-07 14:05:04,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:05:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9231 states and 23011 transitions. [2019-12-07 14:05:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 14:05:04,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,772 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] [2019-12-07 14:05:04,772 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 4 times [2019-12-07 14:05:04,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334472628] [2019-12-07 14:05:04,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,828 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 14:05:04,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334472628] [2019-12-07 14:05:04,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:05:04,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526957848] [2019-12-07 14:05:04,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:05:04,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:05:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:04,830 INFO L87 Difference]: Start difference. First operand 9231 states and 23011 transitions. Second operand 7 states. [2019-12-07 14:05:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:04,905 INFO L93 Difference]: Finished difference Result 7781 states and 19756 transitions. [2019-12-07 14:05:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:05:04,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 14:05:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:04,906 INFO L225 Difference]: With dead ends: 7781 [2019-12-07 14:05:04,906 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 14:05:04,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:05:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 14:05:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 14:05:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 14:05:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1057 transitions. [2019-12-07 14:05:04,911 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1057 transitions. Word has length 50 [2019-12-07 14:05:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:04,911 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1057 transitions. [2019-12-07 14:05:04,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:05:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1057 transitions. [2019-12-07 14:05:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:05:04,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:04,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:04,912 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 14:05:04,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:04,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950121036] [2019-12-07 14:05:04,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:05:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:05:04,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950121036] [2019-12-07 14:05:04,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:05:04,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:05:04,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468424926] [2019-12-07 14:05:04,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:05:04,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:05:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:05:04,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:05:04,958 INFO L87 Difference]: Start difference. First operand 484 states and 1057 transitions. Second operand 7 states. [2019-12-07 14:05:05,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:05:05,078 INFO L93 Difference]: Finished difference Result 989 states and 2125 transitions. [2019-12-07 14:05:05,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:05:05,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 14:05:05,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:05:05,079 INFO L225 Difference]: With dead ends: 989 [2019-12-07 14:05:05,079 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 14:05:05,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:05:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 14:05:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-07 14:05:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 14:05:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1174 transitions. [2019-12-07 14:05:05,084 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1174 transitions. Word has length 66 [2019-12-07 14:05:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:05:05,085 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1174 transitions. [2019-12-07 14:05:05,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:05:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1174 transitions. [2019-12-07 14:05:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:05:05,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:05:05,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:05:05,085 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:05:05,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:05:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-07 14:05:05,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:05:05,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098062596] [2019-12-07 14:05:05,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:05:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:05:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:05:05,179 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:05:05,179 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:05:05,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= 0 |v_ULTIMATE.start_main_~#t197~0.offset_28|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t197~0.base_44|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t197~0.base_44| 1) |v_#valid_88|) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= v_~z$w_buff0~0_341 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t197~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t197~0.base_44|) |v_ULTIMATE.start_main_~#t197~0.offset_28| 0)) |v_#memory_int_29|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t197~0.base_44|) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t197~0.base_44| 4) |v_#length_29|) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t197~0.offset=|v_ULTIMATE.start_main_~#t197~0.offset_28|, ULTIMATE.start_main_~#t200~0.base=|v_ULTIMATE.start_main_~#t200~0.base_24|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, ULTIMATE.start_main_~#t199~0.base=|v_ULTIMATE.start_main_~#t199~0.base_23|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_~#t200~0.offset=|v_ULTIMATE.start_main_~#t200~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t199~0.offset=|v_ULTIMATE.start_main_~#t199~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, ULTIMATE.start_main_~#t197~0.base=|v_ULTIMATE.start_main_~#t197~0.base_44|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t198~0.offset=|v_ULTIMATE.start_main_~#t198~0.offset_24|, ULTIMATE.start_main_~#t198~0.base=|v_ULTIMATE.start_main_~#t198~0.base_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t197~0.offset, ULTIMATE.start_main_~#t200~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t199~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t200~0.offset, ULTIMATE.start_main_#t~ite63, ~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, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t199~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t197~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t198~0.offset, ULTIMATE.start_main_~#t198~0.base, 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 14:05:05,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t198~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t198~0.base_11| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t198~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t198~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t198~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t198~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t198~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t198~0.base_11|) |v_ULTIMATE.start_main_~#t198~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t198~0.offset=|v_ULTIMATE.start_main_~#t198~0.offset_10|, ULTIMATE.start_main_~#t198~0.base=|v_ULTIMATE.start_main_~#t198~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t198~0.offset, ULTIMATE.start_main_~#t198~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:05:05,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t199~0.base_12|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t199~0.base_12|)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t199~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t199~0.base_12|) |v_ULTIMATE.start_main_~#t199~0.offset_11| 2))) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t199~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t199~0.base_12| 4) |v_#length_21|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t199~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t199~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t199~0.offset=|v_ULTIMATE.start_main_~#t199~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t199~0.base=|v_ULTIMATE.start_main_~#t199~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t199~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t199~0.base, #length] because there is no mapped edge [2019-12-07 14:05:05,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t200~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t200~0.base_13| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t200~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t200~0.offset_11|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t200~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t200~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t200~0.base_13|) |v_ULTIMATE.start_main_~#t200~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t200~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t200~0.base=|v_ULTIMATE.start_main_~#t200~0.base_13|, ULTIMATE.start_main_~#t200~0.offset=|v_ULTIMATE.start_main_~#t200~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t200~0.base, ULTIMATE.start_main_~#t200~0.offset] because there is no mapped edge [2019-12-07 14:05:05,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 14:05:05,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1799124596 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1799124596| |P3Thread1of1ForFork2_#t~ite28_Out-1799124596|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1799124596 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff1~0_In-1799124596)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff0~0_In-1799124596) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1799124596|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1799124596|, ~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:05:05,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:05:05,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1149991222 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1149991222| ~z$mem_tmp~0_In-1149991222) (not .cse0)) (and (= ~z~0_In-1149991222 |P3Thread1of1ForFork2_#t~ite48_Out-1149991222|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1149991222|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 14:05:05,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 14:05:05,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 14:05:05,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-686745835 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-686745835| ~z~0_In-686745835)) (and (not .cse0) (= ~z$mem_tmp~0_In-686745835 |P2Thread1of1ForFork1_#t~ite25_Out-686745835|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-686745835|, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:05:05,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork2_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out314902365| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 14:05:05,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1659670332 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1659670332 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1659670332 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1659670332| ~z$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1659670332|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1659670332|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 14:05:05,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1666196578 ~z$r_buff0_thd4~0_In-1666196578)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1666196578 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1666196578 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1666196578 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1666196578} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1666196578|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1666196578} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:05:05,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1234116470 |P3Thread1of1ForFork2_#t~ite54_Out-1234116470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1234116470| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 14:05:05,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:05:05,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:05:05,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:05:05,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-238968068 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-238968068 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite60_Out-238968068| |ULTIMATE.start_main_#t~ite59_Out-238968068|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-238968068| ~z~0_In-238968068) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-238968068 |ULTIMATE.start_main_#t~ite59_Out-238968068|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ~z~0=~z~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-238968068|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-238968068|, ~z~0=~z~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:05:05,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1425828751 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1425828751 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| ~z$w_buff0_used~0_In1425828751)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1425828751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:05:05,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-308165937 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-308165937 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| ~z$w_buff1_used~0_In-308165937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-308165937|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:05:05,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In262309130 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In262309130 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In262309130 |ULTIMATE.start_main_#t~ite63_Out262309130|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out262309130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out262309130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:05:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1603636104| ~z$r_buff1_thd0~0_In1603636104)) (and (= |ULTIMATE.start_main_#t~ite64_Out1603636104| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1603636104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:05:05,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:05:05,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:05:05 BasicIcfg [2019-12-07 14:05:05,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:05:05,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:05:05,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:05:05,286 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:05:05,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:03:45" (3/4) ... [2019-12-07 14:05:05,288 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:05:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= 0 |v_ULTIMATE.start_main_~#t197~0.offset_28|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t197~0.base_44|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t197~0.base_44| 1) |v_#valid_88|) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= v_~z$w_buff0~0_341 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t197~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t197~0.base_44|) |v_ULTIMATE.start_main_~#t197~0.offset_28| 0)) |v_#memory_int_29|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t197~0.base_44|) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t197~0.base_44| 4) |v_#length_29|) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= 0 v_~weak$$choice0~0_191) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t197~0.offset=|v_ULTIMATE.start_main_~#t197~0.offset_28|, ULTIMATE.start_main_~#t200~0.base=|v_ULTIMATE.start_main_~#t200~0.base_24|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, ULTIMATE.start_main_~#t199~0.base=|v_ULTIMATE.start_main_~#t199~0.base_23|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_~#t200~0.offset=|v_ULTIMATE.start_main_~#t200~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t199~0.offset=|v_ULTIMATE.start_main_~#t199~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, ULTIMATE.start_main_~#t197~0.base=|v_ULTIMATE.start_main_~#t197~0.base_44|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t198~0.offset=|v_ULTIMATE.start_main_~#t198~0.offset_24|, ULTIMATE.start_main_~#t198~0.base=|v_ULTIMATE.start_main_~#t198~0.base_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t197~0.offset, ULTIMATE.start_main_~#t200~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t199~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t200~0.offset, ULTIMATE.start_main_#t~ite63, ~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, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t199~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t197~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t198~0.offset, ULTIMATE.start_main_~#t198~0.base, 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 14:05:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t198~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t198~0.base_11| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t198~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t198~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t198~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t198~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t198~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t198~0.base_11|) |v_ULTIMATE.start_main_~#t198~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t198~0.offset=|v_ULTIMATE.start_main_~#t198~0.offset_10|, ULTIMATE.start_main_~#t198~0.base=|v_ULTIMATE.start_main_~#t198~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t198~0.offset, ULTIMATE.start_main_~#t198~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:05:05,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t199~0.base_12|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t199~0.base_12|)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t199~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t199~0.base_12|) |v_ULTIMATE.start_main_~#t199~0.offset_11| 2))) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t199~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t199~0.base_12| 4) |v_#length_21|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t199~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t199~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t199~0.offset=|v_ULTIMATE.start_main_~#t199~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t199~0.base=|v_ULTIMATE.start_main_~#t199~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t199~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t199~0.base, #length] because there is no mapped edge [2019-12-07 14:05:05,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t200~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t200~0.base_13| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t200~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t200~0.offset_11|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t200~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t200~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t200~0.base_13|) |v_ULTIMATE.start_main_~#t200~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t200~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t200~0.base=|v_ULTIMATE.start_main_~#t200~0.base_13|, ULTIMATE.start_main_~#t200~0.offset=|v_ULTIMATE.start_main_~#t200~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t200~0.base, ULTIMATE.start_main_~#t200~0.offset] because there is no mapped edge [2019-12-07 14:05:05,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 14:05:05,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1799124596 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1799124596| |P3Thread1of1ForFork2_#t~ite28_Out-1799124596|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1799124596 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff1~0_In-1799124596)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff0~0_In-1799124596) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1799124596|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1799124596|, ~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 14:05:05,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:05:05,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1149991222 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1149991222| ~z$mem_tmp~0_In-1149991222) (not .cse0)) (and (= ~z~0_In-1149991222 |P3Thread1of1ForFork2_#t~ite48_Out-1149991222|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1149991222|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 14:05:05,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 14:05:05,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 14:05:05,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-686745835 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-686745835| ~z~0_In-686745835)) (and (not .cse0) (= ~z$mem_tmp~0_In-686745835 |P2Thread1of1ForFork1_#t~ite25_Out-686745835|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-686745835|, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 14:05:05,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork2_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out314902365| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 14:05:05,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1659670332 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1659670332 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1659670332 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1659670332| ~z$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1659670332|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1659670332|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 14:05:05,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1666196578 ~z$r_buff0_thd4~0_In-1666196578)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1666196578 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1666196578 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1666196578 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1666196578} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1666196578|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1666196578} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 14:05:05,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1234116470 |P3Thread1of1ForFork2_#t~ite54_Out-1234116470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1234116470| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 14:05:05,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:05:05,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 14:05:05,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:05:05,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-238968068 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-238968068 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite60_Out-238968068| |ULTIMATE.start_main_#t~ite59_Out-238968068|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-238968068| ~z~0_In-238968068) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-238968068 |ULTIMATE.start_main_#t~ite59_Out-238968068|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ~z~0=~z~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-238968068|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-238968068|, ~z~0=~z~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 14:05:05,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1425828751 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1425828751 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| ~z$w_buff0_used~0_In1425828751)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1425828751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 14:05:05,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-308165937 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-308165937 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| ~z$w_buff1_used~0_In-308165937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-308165937|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 14:05:05,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In262309130 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In262309130 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In262309130 |ULTIMATE.start_main_#t~ite63_Out262309130|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out262309130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out262309130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 14:05:05,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1603636104| ~z$r_buff1_thd0~0_In1603636104)) (and (= |ULTIMATE.start_main_#t~ite64_Out1603636104| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1603636104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 14:05:05,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:05:05,381 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6fa02d23-16e9-4f85-93e4-33666f970247/bin/uautomizer/witness.graphml [2019-12-07 14:05:05,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:05:05,383 INFO L168 Benchmark]: Toolchain (without parser) took 81282.15 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 940.9 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 14:05:05,383 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:05:05,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:05,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:05:05,384 INFO L168 Benchmark]: Boogie Preprocessor took 28.07 ms. Allocated memory is still 1.2 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 14:05:05,384 INFO L168 Benchmark]: RCFGBuilder took 467.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:05,385 INFO L168 Benchmark]: TraceAbstraction took 80249.61 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:05:05,385 INFO L168 Benchmark]: Witness Printer took 95.61 ms. Allocated memory is still 7.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:05:05,387 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.07 ms. Allocated memory is still 1.2 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 467.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80249.61 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 95.61 ms. Allocated memory is still 7.4 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t197, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] FCALL, FORK 0 pthread_create(&t198, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L860] FCALL, FORK 0 pthread_create(&t199, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L862] FCALL, FORK 0 pthread_create(&t200, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] 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) [L781] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L781] 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)) [L782] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L782] 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)) [L783] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L783] 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)) [L784] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 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)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 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) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 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 [L871] 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 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 80.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5083 SDtfs, 7740 SDslu, 11936 SDs, 0 SdLazy, 3769 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169865occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 191194 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 130878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...