./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_tso.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_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/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 79a4f11cbd84c2d351089144d730bc00aae84008 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:41:14,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:41:14,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:41:14,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:41:14,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:41:14,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:41:14,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:41:14,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:41:14,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:41:14,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:41:14,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:41:14,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:41:14,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:41:14,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:41:14,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:41:14,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:41:14,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:41:14,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:41:14,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:41:14,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:41:14,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:41:14,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:41:14,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:41:14,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:41:14,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:41:14,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:41:14,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:41:14,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:41:14,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:41:14,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:41:14,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:41:14,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:41:14,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:41:14,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:41:14,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:41:14,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:41:14,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:41:14,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:41:14,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:41:14,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:41:14,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:41:14,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:41:14,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:41:14,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:41:14,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:41:14,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:41:14,559 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:41:14,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:41:14,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:41:14,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:41:14,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:41:14,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:41:14,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:41:14,562 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:41:14,562 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_5077cd44-e75e-4e87-88dc-bc1e52a0588d/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 -> 79a4f11cbd84c2d351089144d730bc00aae84008 [2019-12-07 11:41:14,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:41:14,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:41:14,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:41:14,671 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:41:14,672 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:41:14,672 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix006_tso.opt.i [2019-12-07 11:41:14,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/data/f46b11ef2/9cf851508e454b8bb5edfc2856e66136/FLAG26199abe1 [2019-12-07 11:41:15,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:41:15,182 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/sv-benchmarks/c/pthread-wmm/mix006_tso.opt.i [2019-12-07 11:41:15,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/data/f46b11ef2/9cf851508e454b8bb5edfc2856e66136/FLAG26199abe1 [2019-12-07 11:41:15,201 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/data/f46b11ef2/9cf851508e454b8bb5edfc2856e66136 [2019-12-07 11:41:15,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:41:15,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:41:15,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:41:15,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:41:15,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:41:15,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15, skipping insertion in model container [2019-12-07 11:41:15,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:41:15,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:41:15,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:41:15,498 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:41:15,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:41:15,585 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:41:15,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15 WrapperNode [2019-12-07 11:41:15,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:41:15,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:41:15,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:41:15,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:41:15,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:41:15,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:41:15,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:41:15,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:41:15,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... [2019-12-07 11:41:15,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:41:15,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:41:15,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:41:15,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:41:15,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/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 11:41:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:41:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:41:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:41:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:41:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:41:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:41:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:41:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:41:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:41:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:41:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:41:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:41:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:41:15,694 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 11:41:16,098 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:41:16,098 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:41:16,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:41:16 BoogieIcfgContainer [2019-12-07 11:41:16,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:41:16,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:41:16,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:41:16,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:41:16,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:41:15" (1/3) ... [2019-12-07 11:41:16,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27693345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:41:16, skipping insertion in model container [2019-12-07 11:41:16,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:41:15" (2/3) ... [2019-12-07 11:41:16,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27693345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:41:16, skipping insertion in model container [2019-12-07 11:41:16,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:41:16" (3/3) ... [2019-12-07 11:41:16,104 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_tso.opt.i [2019-12-07 11:41:16,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:41:16,110 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:41:16,115 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:41:16,115 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:41:16,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:41:16,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:41:16,198 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:41:16,198 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:41:16,198 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:41:16,198 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:41:16,198 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:41:16,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:41:16,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:41:16,199 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:41:16,209 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 11:41:16,210 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 11:41:16,281 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 11:41:16,281 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:41:16,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:41:16,318 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 11:41:16,353 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 11:41:16,353 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:41:16,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 11:41:16,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 11:41:16,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:41:19,672 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 11:41:19,777 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-07 11:41:19,777 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 11:41:19,779 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-07 11:41:22,785 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-07 11:41:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-07 11:41:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:41:22,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:22,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:22,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-07 11:41:22,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:22,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405283203] [2019-12-07 11:41:22,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:22,944 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 11:41:22,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405283203] [2019-12-07 11:41:22,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:22,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:41:22,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355697390] [2019-12-07 11:41:22,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:22,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:22,959 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-07 11:41:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:23,404 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-07 11:41:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:23,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:41:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:23,666 INFO L225 Difference]: With dead ends: 46894 [2019-12-07 11:41:23,666 INFO L226 Difference]: Without dead ends: 43674 [2019-12-07 11:41:23,667 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 11:41:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-07 11:41:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-07 11:41:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-07 11:41:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-07 11:41:25,326 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-07 11:41:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:25,328 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-07 11:41:25,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-07 11:41:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:41:25,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:25,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:25,332 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-07 11:41:25,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:25,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379223936] [2019-12-07 11:41:25,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:25,393 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 11:41:25,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379223936] [2019-12-07 11:41:25,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:25,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:25,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819410287] [2019-12-07 11:41:25,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:25,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:25,395 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 4 states. [2019-12-07 11:41:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:25,879 INFO L93 Difference]: Finished difference Result 69642 states and 274292 transitions. [2019-12-07 11:41:25,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:25,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:41:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:26,148 INFO L225 Difference]: With dead ends: 69642 [2019-12-07 11:41:26,149 INFO L226 Difference]: Without dead ends: 69610 [2019-12-07 11:41:26,149 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 11:41:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69610 states. [2019-12-07 11:41:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69610 to 67954. [2019-12-07 11:41:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67954 states. [2019-12-07 11:41:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67954 states to 67954 states and 269064 transitions. [2019-12-07 11:41:28,149 INFO L78 Accepts]: Start accepts. Automaton has 67954 states and 269064 transitions. Word has length 13 [2019-12-07 11:41:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:28,149 INFO L462 AbstractCegarLoop]: Abstraction has 67954 states and 269064 transitions. [2019-12-07 11:41:28,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 67954 states and 269064 transitions. [2019-12-07 11:41:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:41:28,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:28,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:28,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-07 11:41:28,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:28,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995223014] [2019-12-07 11:41:28,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:28,199 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 11:41:28,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995223014] [2019-12-07 11:41:28,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:28,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:28,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890173016] [2019-12-07 11:41:28,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:28,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:28,201 INFO L87 Difference]: Start difference. First operand 67954 states and 269064 transitions. Second operand 4 states. [2019-12-07 11:41:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:28,711 INFO L93 Difference]: Finished difference Result 86818 states and 338660 transitions. [2019-12-07 11:41:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:28,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:41:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:28,901 INFO L225 Difference]: With dead ends: 86818 [2019-12-07 11:41:28,901 INFO L226 Difference]: Without dead ends: 86790 [2019-12-07 11:41:28,902 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 11:41:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86790 states. [2019-12-07 11:41:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86790 to 77804. [2019-12-07 11:41:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77804 states. [2019-12-07 11:41:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77804 states to 77804 states and 306271 transitions. [2019-12-07 11:41:32,107 INFO L78 Accepts]: Start accepts. Automaton has 77804 states and 306271 transitions. Word has length 16 [2019-12-07 11:41:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:32,107 INFO L462 AbstractCegarLoop]: Abstraction has 77804 states and 306271 transitions. [2019-12-07 11:41:32,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 77804 states and 306271 transitions. [2019-12-07 11:41:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:41:32,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:32,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:32,111 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:32,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-07 11:41:32,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:32,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613024222] [2019-12-07 11:41:32,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:32,137 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 11:41:32,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613024222] [2019-12-07 11:41:32,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:32,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:32,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737422146] [2019-12-07 11:41:32,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:32,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:32,138 INFO L87 Difference]: Start difference. First operand 77804 states and 306271 transitions. Second operand 3 states. [2019-12-07 11:41:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:32,720 INFO L93 Difference]: Finished difference Result 129752 states and 490387 transitions. [2019-12-07 11:41:32,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:32,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 11:41:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:33,021 INFO L225 Difference]: With dead ends: 129752 [2019-12-07 11:41:33,021 INFO L226 Difference]: Without dead ends: 129752 [2019-12-07 11:41:33,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129752 states. [2019-12-07 11:41:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129752 to 115674. [2019-12-07 11:41:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-12-07 11:41:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 443292 transitions. [2019-12-07 11:41:36,001 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 443292 transitions. Word has length 17 [2019-12-07 11:41:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:36,001 INFO L462 AbstractCegarLoop]: Abstraction has 115674 states and 443292 transitions. [2019-12-07 11:41:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 443292 transitions. [2019-12-07 11:41:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:41:36,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:36,010 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 11:41:36,010 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1223807206, now seen corresponding path program 1 times [2019-12-07 11:41:36,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:36,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756966832] [2019-12-07 11:41:36,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:36,053 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 11:41:36,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756966832] [2019-12-07 11:41:36,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:36,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:36,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940471945] [2019-12-07 11:41:36,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:36,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:36,055 INFO L87 Difference]: Start difference. First operand 115674 states and 443292 transitions. Second operand 3 states. [2019-12-07 11:41:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:36,269 INFO L93 Difference]: Finished difference Result 63592 states and 212108 transitions. [2019-12-07 11:41:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:36,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 11:41:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:36,378 INFO L225 Difference]: With dead ends: 63592 [2019-12-07 11:41:36,378 INFO L226 Difference]: Without dead ends: 63592 [2019-12-07 11:41:36,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2019-12-07 11:41:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63592. [2019-12-07 11:41:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63592 states. [2019-12-07 11:41:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63592 states to 63592 states and 212108 transitions. [2019-12-07 11:41:37,792 INFO L78 Accepts]: Start accepts. Automaton has 63592 states and 212108 transitions. Word has length 18 [2019-12-07 11:41:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 63592 states and 212108 transitions. [2019-12-07 11:41:37,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63592 states and 212108 transitions. [2019-12-07 11:41:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:41:37,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:37,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:37,797 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash 377507519, now seen corresponding path program 1 times [2019-12-07 11:41:37,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:37,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797445002] [2019-12-07 11:41:37,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:37,869 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 11:41:37,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797445002] [2019-12-07 11:41:37,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:37,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:37,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68016974] [2019-12-07 11:41:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:37,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:37,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:37,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:37,870 INFO L87 Difference]: Start difference. First operand 63592 states and 212108 transitions. Second operand 4 states. [2019-12-07 11:41:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:38,117 INFO L93 Difference]: Finished difference Result 72992 states and 242045 transitions. [2019-12-07 11:41:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:41:38,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:41:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:38,243 INFO L225 Difference]: With dead ends: 72992 [2019-12-07 11:41:38,243 INFO L226 Difference]: Without dead ends: 72476 [2019-12-07 11:41:38,243 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 11:41:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72476 states. [2019-12-07 11:41:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72476 to 72391. [2019-12-07 11:41:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72391 states. [2019-12-07 11:41:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72391 states to 72391 states and 240324 transitions. [2019-12-07 11:41:39,817 INFO L78 Accepts]: Start accepts. Automaton has 72391 states and 240324 transitions. Word has length 19 [2019-12-07 11:41:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:39,818 INFO L462 AbstractCegarLoop]: Abstraction has 72391 states and 240324 transitions. [2019-12-07 11:41:39,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 72391 states and 240324 transitions. [2019-12-07 11:41:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 11:41:39,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:39,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:39,822 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-07 11:41:39,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:39,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120709425] [2019-12-07 11:41:39,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:39,860 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 11:41:39,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120709425] [2019-12-07 11:41:39,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:39,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:39,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731429330] [2019-12-07 11:41:39,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:39,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:39,862 INFO L87 Difference]: Start difference. First operand 72391 states and 240324 transitions. Second operand 4 states. [2019-12-07 11:41:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:40,309 INFO L93 Difference]: Finished difference Result 89667 states and 293135 transitions. [2019-12-07 11:41:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:40,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 11:41:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:40,459 INFO L225 Difference]: With dead ends: 89667 [2019-12-07 11:41:40,460 INFO L226 Difference]: Without dead ends: 89650 [2019-12-07 11:41:40,460 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 11:41:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89650 states. [2019-12-07 11:41:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89650 to 73395. [2019-12-07 11:41:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73395 states. [2019-12-07 11:41:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73395 states to 73395 states and 243554 transitions. [2019-12-07 11:41:42,023 INFO L78 Accepts]: Start accepts. Automaton has 73395 states and 243554 transitions. Word has length 19 [2019-12-07 11:41:42,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:42,024 INFO L462 AbstractCegarLoop]: Abstraction has 73395 states and 243554 transitions. [2019-12-07 11:41:42,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 73395 states and 243554 transitions. [2019-12-07 11:41:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:41:42,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:42,033 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] [2019-12-07 11:41:42,033 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:42,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1058468438, now seen corresponding path program 1 times [2019-12-07 11:41:42,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:42,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153526420] [2019-12-07 11:41:42,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:42,076 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 11:41:42,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153526420] [2019-12-07 11:41:42,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:42,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:42,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056370839] [2019-12-07 11:41:42,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:42,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:42,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:42,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:42,077 INFO L87 Difference]: Start difference. First operand 73395 states and 243554 transitions. Second operand 5 states. [2019-12-07 11:41:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:42,907 INFO L93 Difference]: Finished difference Result 102817 states and 332646 transitions. [2019-12-07 11:41:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:41:42,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 11:41:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:43,087 INFO L225 Difference]: With dead ends: 102817 [2019-12-07 11:41:43,087 INFO L226 Difference]: Without dead ends: 102802 [2019-12-07 11:41:43,087 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 11:41:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102802 states. [2019-12-07 11:41:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102802 to 80806. [2019-12-07 11:41:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80806 states. [2019-12-07 11:41:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80806 states to 80806 states and 266700 transitions. [2019-12-07 11:41:44,923 INFO L78 Accepts]: Start accepts. Automaton has 80806 states and 266700 transitions. Word has length 23 [2019-12-07 11:41:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:44,923 INFO L462 AbstractCegarLoop]: Abstraction has 80806 states and 266700 transitions. [2019-12-07 11:41:44,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:41:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 80806 states and 266700 transitions. [2019-12-07 11:41:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:41:44,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:44,943 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] [2019-12-07 11:41:44,943 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:44,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash -785715849, now seen corresponding path program 1 times [2019-12-07 11:41:44,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:44,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156838465] [2019-12-07 11:41:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:44,990 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 11:41:44,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156838465] [2019-12-07 11:41:44,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:44,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:44,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537794891] [2019-12-07 11:41:44,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:44,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:44,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:44,992 INFO L87 Difference]: Start difference. First operand 80806 states and 266700 transitions. Second operand 5 states. [2019-12-07 11:41:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:45,702 INFO L93 Difference]: Finished difference Result 107049 states and 345843 transitions. [2019-12-07 11:41:45,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:41:45,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:41:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:45,895 INFO L225 Difference]: With dead ends: 107049 [2019-12-07 11:41:45,895 INFO L226 Difference]: Without dead ends: 107020 [2019-12-07 11:41:45,895 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 11:41:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107020 states. [2019-12-07 11:41:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107020 to 75120. [2019-12-07 11:41:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75120 states. [2019-12-07 11:41:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75120 states to 75120 states and 248534 transitions. [2019-12-07 11:41:47,754 INFO L78 Accepts]: Start accepts. Automaton has 75120 states and 248534 transitions. Word has length 26 [2019-12-07 11:41:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:47,754 INFO L462 AbstractCegarLoop]: Abstraction has 75120 states and 248534 transitions. [2019-12-07 11:41:47,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:41:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75120 states and 248534 transitions. [2019-12-07 11:41:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:41:47,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:47,802 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:47,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash -474080617, now seen corresponding path program 1 times [2019-12-07 11:41:47,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:47,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39970798] [2019-12-07 11:41:47,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:47,857 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 11:41:47,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39970798] [2019-12-07 11:41:47,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:47,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:41:47,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420304753] [2019-12-07 11:41:47,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:47,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:47,859 INFO L87 Difference]: Start difference. First operand 75120 states and 248534 transitions. Second operand 4 states. [2019-12-07 11:41:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:48,462 INFO L93 Difference]: Finished difference Result 141859 states and 461880 transitions. [2019-12-07 11:41:48,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:41:48,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 11:41:48,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:48,729 INFO L225 Difference]: With dead ends: 141859 [2019-12-07 11:41:48,729 INFO L226 Difference]: Without dead ends: 141859 [2019-12-07 11:41:48,729 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 11:41:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141859 states. [2019-12-07 11:41:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141859 to 95914. [2019-12-07 11:41:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95914 states. [2019-12-07 11:41:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95914 states to 95914 states and 318403 transitions. [2019-12-07 11:41:51,208 INFO L78 Accepts]: Start accepts. Automaton has 95914 states and 318403 transitions. Word has length 33 [2019-12-07 11:41:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:51,208 INFO L462 AbstractCegarLoop]: Abstraction has 95914 states and 318403 transitions. [2019-12-07 11:41:51,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 95914 states and 318403 transitions. [2019-12-07 11:41:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:41:51,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:51,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:51,259 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:51,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:51,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2084015207, now seen corresponding path program 2 times [2019-12-07 11:41:51,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:51,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512927285] [2019-12-07 11:41:51,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:51,290 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 11:41:51,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512927285] [2019-12-07 11:41:51,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:51,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:51,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976349700] [2019-12-07 11:41:51,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:51,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:51,291 INFO L87 Difference]: Start difference. First operand 95914 states and 318403 transitions. Second operand 4 states. [2019-12-07 11:41:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:51,338 INFO L93 Difference]: Finished difference Result 16140 states and 43130 transitions. [2019-12-07 11:41:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:41:51,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 11:41:51,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:51,354 INFO L225 Difference]: With dead ends: 16140 [2019-12-07 11:41:51,354 INFO L226 Difference]: Without dead ends: 16140 [2019-12-07 11:41:51,355 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 11:41:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16140 states. [2019-12-07 11:41:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16140 to 15133. [2019-12-07 11:41:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15133 states. [2019-12-07 11:41:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15133 states to 15133 states and 40757 transitions. [2019-12-07 11:41:51,527 INFO L78 Accepts]: Start accepts. Automaton has 15133 states and 40757 transitions. Word has length 33 [2019-12-07 11:41:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:51,528 INFO L462 AbstractCegarLoop]: Abstraction has 15133 states and 40757 transitions. [2019-12-07 11:41:51,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 15133 states and 40757 transitions. [2019-12-07 11:41:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:41:51,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:51,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:51,541 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash 657313514, now seen corresponding path program 1 times [2019-12-07 11:41:51,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:51,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352100681] [2019-12-07 11:41:51,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:51,587 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 11:41:51,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352100681] [2019-12-07 11:41:51,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:51,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:41:51,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3116647] [2019-12-07 11:41:51,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:51,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:51,588 INFO L87 Difference]: Start difference. First operand 15133 states and 40757 transitions. Second operand 5 states. [2019-12-07 11:41:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:51,633 INFO L93 Difference]: Finished difference Result 11803 states and 32941 transitions. [2019-12-07 11:41:51,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:51,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 11:41:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:51,645 INFO L225 Difference]: With dead ends: 11803 [2019-12-07 11:41:51,645 INFO L226 Difference]: Without dead ends: 11746 [2019-12-07 11:41:51,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11746 states. [2019-12-07 11:41:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11746 to 8986. [2019-12-07 11:41:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8986 states. [2019-12-07 11:41:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8986 states to 8986 states and 26014 transitions. [2019-12-07 11:41:51,758 INFO L78 Accepts]: Start accepts. Automaton has 8986 states and 26014 transitions. Word has length 44 [2019-12-07 11:41:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:51,758 INFO L462 AbstractCegarLoop]: Abstraction has 8986 states and 26014 transitions. [2019-12-07 11:41:51,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:41:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 8986 states and 26014 transitions. [2019-12-07 11:41:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 11:41:51,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:51,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:51,767 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:51,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:51,767 INFO L82 PathProgramCache]: Analyzing trace with hash 29406577, now seen corresponding path program 1 times [2019-12-07 11:41:51,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:51,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329537313] [2019-12-07 11:41:51,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:41:51,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329537313] [2019-12-07 11:41:51,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:51,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:51,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106615313] [2019-12-07 11:41:51,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:51,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:51,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:51,812 INFO L87 Difference]: Start difference. First operand 8986 states and 26014 transitions. Second operand 3 states. [2019-12-07 11:41:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:51,839 INFO L93 Difference]: Finished difference Result 8986 states and 26013 transitions. [2019-12-07 11:41:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:51,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 11:41:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:51,849 INFO L225 Difference]: With dead ends: 8986 [2019-12-07 11:41:51,850 INFO L226 Difference]: Without dead ends: 8986 [2019-12-07 11:41:51,850 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 11:41:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8986 states. [2019-12-07 11:41:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8986 to 8851. [2019-12-07 11:41:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8851 states. [2019-12-07 11:41:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 25716 transitions. [2019-12-07 11:41:51,947 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 25716 transitions. Word has length 61 [2019-12-07 11:41:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:51,947 INFO L462 AbstractCegarLoop]: Abstraction has 8851 states and 25716 transitions. [2019-12-07 11:41:51,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 25716 transitions. [2019-12-07 11:41:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:41:51,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:51,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:51,955 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1468892539, now seen corresponding path program 1 times [2019-12-07 11:41:51,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:51,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67002186] [2019-12-07 11:41:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:52,036 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 11:41:52,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67002186] [2019-12-07 11:41:52,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:52,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:41:52,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855377400] [2019-12-07 11:41:52,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:41:52,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:41:52,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:41:52,037 INFO L87 Difference]: Start difference. First operand 8851 states and 25716 transitions. Second operand 7 states. [2019-12-07 11:41:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:52,248 INFO L93 Difference]: Finished difference Result 21850 states and 62165 transitions. [2019-12-07 11:41:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:41:52,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 11:41:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:52,267 INFO L225 Difference]: With dead ends: 21850 [2019-12-07 11:41:52,267 INFO L226 Difference]: Without dead ends: 17536 [2019-12-07 11:41:52,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:41:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17536 states. [2019-12-07 11:41:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17536 to 13713. [2019-12-07 11:41:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13713 states. [2019-12-07 11:41:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13713 states to 13713 states and 40031 transitions. [2019-12-07 11:41:52,469 INFO L78 Accepts]: Start accepts. Automaton has 13713 states and 40031 transitions. Word has length 62 [2019-12-07 11:41:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:52,469 INFO L462 AbstractCegarLoop]: Abstraction has 13713 states and 40031 transitions. [2019-12-07 11:41:52,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:41:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13713 states and 40031 transitions. [2019-12-07 11:41:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 11:41:52,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:52,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:52,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash -675091551, now seen corresponding path program 2 times [2019-12-07 11:41:52,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:52,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938937306] [2019-12-07 11:41:52,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:52,547 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 11:41:52,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938937306] [2019-12-07 11:41:52,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:52,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:52,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116945893] [2019-12-07 11:41:52,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:52,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:52,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:52,549 INFO L87 Difference]: Start difference. First operand 13713 states and 40031 transitions. Second operand 4 states. [2019-12-07 11:41:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:52,634 INFO L93 Difference]: Finished difference Result 20041 states and 55457 transitions. [2019-12-07 11:41:52,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:52,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 11:41:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:52,649 INFO L225 Difference]: With dead ends: 20041 [2019-12-07 11:41:52,649 INFO L226 Difference]: Without dead ends: 12412 [2019-12-07 11:41:52,649 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 11:41:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12412 states. [2019-12-07 11:41:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12412 to 8653. [2019-12-07 11:41:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8653 states. [2019-12-07 11:41:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8653 states to 8653 states and 24881 transitions. [2019-12-07 11:41:52,767 INFO L78 Accepts]: Start accepts. Automaton has 8653 states and 24881 transitions. Word has length 62 [2019-12-07 11:41:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:52,767 INFO L462 AbstractCegarLoop]: Abstraction has 8653 states and 24881 transitions. [2019-12-07 11:41:52,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8653 states and 24881 transitions. [2019-12-07 11:41:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:41:52,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:52,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:52,775 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:52,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1844822754, now seen corresponding path program 1 times [2019-12-07 11:41:52,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:52,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089381739] [2019-12-07 11:41:52,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:52,846 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 11:41:52,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089381739] [2019-12-07 11:41:52,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:52,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:41:52,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750039085] [2019-12-07 11:41:52,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:52,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:52,848 INFO L87 Difference]: Start difference. First operand 8653 states and 24881 transitions. Second operand 5 states. [2019-12-07 11:41:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:52,921 INFO L93 Difference]: Finished difference Result 13489 states and 36396 transitions. [2019-12-07 11:41:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:41:52,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 11:41:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:52,928 INFO L225 Difference]: With dead ends: 13489 [2019-12-07 11:41:52,928 INFO L226 Difference]: Without dead ends: 5960 [2019-12-07 11:41:52,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:41:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2019-12-07 11:41:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5383. [2019-12-07 11:41:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-12-07 11:41:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 13731 transitions. [2019-12-07 11:41:52,984 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 13731 transitions. Word has length 63 [2019-12-07 11:41:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:52,984 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 13731 transitions. [2019-12-07 11:41:52,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:41:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 13731 transitions. [2019-12-07 11:41:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:41:52,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:52,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:52,988 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash -942471944, now seen corresponding path program 2 times [2019-12-07 11:41:52,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:52,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684879683] [2019-12-07 11:41:52,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:53,051 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 11:41:53,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684879683] [2019-12-07 11:41:53,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:53,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:53,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11614122] [2019-12-07 11:41:53,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:53,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:53,053 INFO L87 Difference]: Start difference. First operand 5383 states and 13731 transitions. Second operand 4 states. [2019-12-07 11:41:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:53,086 INFO L93 Difference]: Finished difference Result 6007 states and 15177 transitions. [2019-12-07 11:41:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:41:53,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 11:41:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:53,087 INFO L225 Difference]: With dead ends: 6007 [2019-12-07 11:41:53,087 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 11:41:53,088 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 11:41:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 11:41:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 725. [2019-12-07 11:41:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-12-07 11:41:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1601 transitions. [2019-12-07 11:41:53,096 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1601 transitions. Word has length 63 [2019-12-07 11:41:53,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:53,096 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1601 transitions. [2019-12-07 11:41:53,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1601 transitions. [2019-12-07 11:41:53,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:41:53,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:53,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:53,098 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:53,098 INFO L82 PathProgramCache]: Analyzing trace with hash 424994232, now seen corresponding path program 3 times [2019-12-07 11:41:53,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:53,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929762683] [2019-12-07 11:41:53,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:53,170 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 11:41:53,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929762683] [2019-12-07 11:41:53,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:53,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:41:53,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085118951] [2019-12-07 11:41:53,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:41:53,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:41:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:41:53,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:41:53,171 INFO L87 Difference]: Start difference. First operand 725 states and 1601 transitions. Second operand 7 states. [2019-12-07 11:41:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:53,368 INFO L93 Difference]: Finished difference Result 1341 states and 2897 transitions. [2019-12-07 11:41:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:41:53,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 11:41:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:53,369 INFO L225 Difference]: With dead ends: 1341 [2019-12-07 11:41:53,369 INFO L226 Difference]: Without dead ends: 1034 [2019-12-07 11:41:53,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:41:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-12-07 11:41:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 810. [2019-12-07 11:41:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-12-07 11:41:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1755 transitions. [2019-12-07 11:41:53,377 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1755 transitions. Word has length 63 [2019-12-07 11:41:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:53,377 INFO L462 AbstractCegarLoop]: Abstraction has 810 states and 1755 transitions. [2019-12-07 11:41:53,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:41:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1755 transitions. [2019-12-07 11:41:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 11:41:53,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:53,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:53,378 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 4 times [2019-12-07 11:41:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:41:53,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197377310] [2019-12-07 11:41:53,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:41:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:41:53,448 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:41:53,448 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:41:53,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t174~0.base_25| 1)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t174~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t174~0.base_25|) |v_ULTIMATE.start_main_~#t174~0.offset_18| 0))) (= v_~y$w_buff0_used~0_960 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t174~0.base_25| 4) |v_#length_23|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t174~0.base_25|) 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= |v_ULTIMATE.start_main_~#t174~0.offset_18| 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t174~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t175~0.base=|v_ULTIMATE.start_main_~#t175~0.base_26|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t174~0.offset=|v_ULTIMATE.start_main_~#t174~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_~#t176~0.offset=|v_ULTIMATE.start_main_~#t176~0.offset_15|, ULTIMATE.start_main_~#t175~0.offset=|v_ULTIMATE.start_main_~#t175~0.offset_19|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ULTIMATE.start_main_~#t176~0.base=|v_ULTIMATE.start_main_~#t176~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ULTIMATE.start_main_~#t174~0.base=|v_ULTIMATE.start_main_~#t174~0.base_25|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t175~0.base, #NULL.offset, ULTIMATE.start_main_~#t174~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t176~0.offset, ULTIMATE.start_main_~#t175~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t176~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t174~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:41:53,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t175~0.base_13|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t175~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t175~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t175~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t175~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t175~0.base_13|) |v_ULTIMATE.start_main_~#t175~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t175~0.base_13| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t175~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t175~0.offset=|v_ULTIMATE.start_main_~#t175~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t175~0.base=|v_ULTIMATE.start_main_~#t175~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t175~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t175~0.base, #length] because there is no mapped edge [2019-12-07 11:41:53,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t176~0.base_12| 1) |v_#valid_32|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t176~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t176~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t176~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t176~0.base_12|) |v_ULTIMATE.start_main_~#t176~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t176~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t176~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t176~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t176~0.base=|v_ULTIMATE.start_main_~#t176~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t176~0.offset=|v_ULTIMATE.start_main_~#t176~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t176~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t176~0.offset] because there is no mapped edge [2019-12-07 11:41:53,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:41:53,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2078305353 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In2078305353 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out2078305353| ~y$w_buff0~0_In2078305353)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out2078305353| ~y$w_buff1~0_In2078305353) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$w_buff1~0=~y$w_buff1~0_In2078305353, ~y$w_buff0~0=~y$w_buff0~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out2078305353|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$w_buff1~0=~y$w_buff1~0_In2078305353, ~y$w_buff0~0=~y$w_buff0~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:41:53,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 11:41:53,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:41:53,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-573493417 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-573493417| ~y$mem_tmp~0_In-573493417) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-573493417| ~y~0_In-573493417) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-573493417, ~y$flush_delayed~0=~y$flush_delayed~0_In-573493417, ~y~0=~y~0_In-573493417} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-573493417|, ~y$mem_tmp~0=~y$mem_tmp~0_In-573493417, ~y$flush_delayed~0=~y$flush_delayed~0_In-573493417, ~y~0=~y~0_In-573493417} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:41:53,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:41:53,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1844480639 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1844480639| ~y$mem_tmp~0_In1844480639) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1844480639| ~y~0_In1844480639) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1844480639, ~y$flush_delayed~0=~y$flush_delayed~0_In1844480639, ~y~0=~y~0_In1844480639} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1844480639, ~y$flush_delayed~0=~y$flush_delayed~0_In1844480639, ~y~0=~y~0_In1844480639, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1844480639|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:41:53,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:41:53,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-581174486 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-581174486 256) 0))) (or (and (= ~y$w_buff0_used~0_In-581174486 |P2Thread1of1ForFork0_#t~ite51_Out-581174486|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-581174486|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-581174486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-581174486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-581174486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-581174486, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-581174486|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:41:53,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In946140005 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In946140005 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In946140005 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In946140005 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out946140005| ~y$w_buff1_used~0_In946140005)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out946140005| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In946140005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946140005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In946140005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946140005} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In946140005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946140005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In946140005, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out946140005|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946140005} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:41:53,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1120473615 ~y$r_buff0_thd3~0_Out-1120473615)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1120473615 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1120473615 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-1120473615) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120473615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1120473615} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120473615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1120473615, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1120473615|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:41:53,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-2132641505 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2132641505 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2132641505 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2132641505 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out-2132641505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-2132641505| ~y$r_buff1_thd3~0_In-2132641505) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2132641505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132641505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132641505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132641505} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2132641505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132641505, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-2132641505|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132641505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132641505} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:41:53,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:41:53,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:41:53,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In256755943 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In256755943 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out256755943| |ULTIMATE.start_main_#t~ite58_Out256755943|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In256755943 |ULTIMATE.start_main_#t~ite58_Out256755943|) (not .cse2)) (and (or .cse2 .cse0) (= ~y~0_In256755943 |ULTIMATE.start_main_#t~ite58_Out256755943|) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y~0=~y~0_In256755943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In256755943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In256755943} OutVars{~y$w_buff1~0=~y$w_buff1~0_In256755943, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out256755943|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out256755943|, ~y~0=~y~0_In256755943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In256755943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In256755943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:41:53,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In640887100 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In640887100 256) 0))) (or (and (= ~y$w_buff0_used~0_In640887100 |ULTIMATE.start_main_#t~ite60_Out640887100|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out640887100| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In640887100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640887100} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out640887100|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In640887100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640887100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:41:53,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In373670562 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In373670562 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In373670562 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In373670562 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In373670562 |ULTIMATE.start_main_#t~ite61_Out373670562|)) (and (= |ULTIMATE.start_main_#t~ite61_Out373670562| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In373670562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373670562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In373670562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373670562} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out373670562|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373670562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373670562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In373670562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373670562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:41:53,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1310134971 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1310134971 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1310134971|)) (and (= ~y$r_buff0_thd0~0_In-1310134971 |ULTIMATE.start_main_#t~ite62_Out-1310134971|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310134971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310134971} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1310134971|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310134971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310134971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:41:53,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-997616385 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-997616385 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997616385 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-997616385 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-997616385| ~y$r_buff1_thd0~0_In-997616385) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out-997616385| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-997616385|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:41:53,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:41:53,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:41:53 BasicIcfg [2019-12-07 11:41:53,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:41:53,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:41:53,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:41:53,528 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:41:53,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:41:16" (3/4) ... [2019-12-07 11:41:53,530 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:41:53,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t174~0.base_25| 1)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t174~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t174~0.base_25|) |v_ULTIMATE.start_main_~#t174~0.offset_18| 0))) (= v_~y$w_buff0_used~0_960 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t174~0.base_25| 4) |v_#length_23|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t174~0.base_25|) 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= |v_ULTIMATE.start_main_~#t174~0.offset_18| 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t174~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t175~0.base=|v_ULTIMATE.start_main_~#t175~0.base_26|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t174~0.offset=|v_ULTIMATE.start_main_~#t174~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_~#t176~0.offset=|v_ULTIMATE.start_main_~#t176~0.offset_15|, ULTIMATE.start_main_~#t175~0.offset=|v_ULTIMATE.start_main_~#t175~0.offset_19|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ULTIMATE.start_main_~#t176~0.base=|v_ULTIMATE.start_main_~#t176~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ULTIMATE.start_main_~#t174~0.base=|v_ULTIMATE.start_main_~#t174~0.base_25|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t175~0.base, #NULL.offset, ULTIMATE.start_main_~#t174~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t176~0.offset, ULTIMATE.start_main_~#t175~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t176~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t174~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:41:53,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t175~0.base_13|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t175~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t175~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t175~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t175~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t175~0.base_13|) |v_ULTIMATE.start_main_~#t175~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t175~0.base_13| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t175~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t175~0.offset=|v_ULTIMATE.start_main_~#t175~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t175~0.base=|v_ULTIMATE.start_main_~#t175~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t175~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t175~0.base, #length] because there is no mapped edge [2019-12-07 11:41:53,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t176~0.base_12| 1) |v_#valid_32|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t176~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t176~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t176~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t176~0.base_12|) |v_ULTIMATE.start_main_~#t176~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t176~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t176~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t176~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t176~0.base=|v_ULTIMATE.start_main_~#t176~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t176~0.offset=|v_ULTIMATE.start_main_~#t176~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t176~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t176~0.offset] because there is no mapped edge [2019-12-07 11:41:53,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 11:41:53,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2078305353 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In2078305353 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out2078305353| ~y$w_buff0~0_In2078305353)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out2078305353| ~y$w_buff1~0_In2078305353) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$w_buff1~0=~y$w_buff1~0_In2078305353, ~y$w_buff0~0=~y$w_buff0~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out2078305353|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$w_buff1~0=~y$w_buff1~0_In2078305353, ~y$w_buff0~0=~y$w_buff0~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:41:53,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 11:41:53,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:41:53,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-573493417 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-573493417| ~y$mem_tmp~0_In-573493417) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out-573493417| ~y~0_In-573493417) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-573493417, ~y$flush_delayed~0=~y$flush_delayed~0_In-573493417, ~y~0=~y~0_In-573493417} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-573493417|, ~y$mem_tmp~0=~y$mem_tmp~0_In-573493417, ~y$flush_delayed~0=~y$flush_delayed~0_In-573493417, ~y~0=~y~0_In-573493417} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 11:41:53,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:41:53,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1844480639 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1844480639| ~y$mem_tmp~0_In1844480639) (not .cse0)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1844480639| ~y~0_In1844480639) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1844480639, ~y$flush_delayed~0=~y$flush_delayed~0_In1844480639, ~y~0=~y~0_In1844480639} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1844480639, ~y$flush_delayed~0=~y$flush_delayed~0_In1844480639, ~y~0=~y~0_In1844480639, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1844480639|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:41:53,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:41:53,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-581174486 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-581174486 256) 0))) (or (and (= ~y$w_buff0_used~0_In-581174486 |P2Thread1of1ForFork0_#t~ite51_Out-581174486|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-581174486|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-581174486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-581174486} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-581174486, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-581174486, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-581174486|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 11:41:53,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In946140005 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In946140005 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In946140005 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In946140005 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out946140005| ~y$w_buff1_used~0_In946140005)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out946140005| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In946140005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946140005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In946140005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946140005} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In946140005, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946140005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In946140005, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out946140005|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In946140005} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 11:41:53,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1120473615 ~y$r_buff0_thd3~0_Out-1120473615)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1120473615 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1120473615 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-1120473615) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120473615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1120473615} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1120473615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1120473615, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1120473615|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 11:41:53,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-2132641505 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2132641505 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2132641505 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2132641505 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out-2132641505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-2132641505| ~y$r_buff1_thd3~0_In-2132641505) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2132641505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132641505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132641505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132641505} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2132641505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132641505, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-2132641505|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2132641505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132641505} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 11:41:53,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:41:53,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:41:53,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In256755943 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In256755943 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite59_Out256755943| |ULTIMATE.start_main_#t~ite58_Out256755943|))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In256755943 |ULTIMATE.start_main_#t~ite58_Out256755943|) (not .cse2)) (and (or .cse2 .cse0) (= ~y~0_In256755943 |ULTIMATE.start_main_#t~ite58_Out256755943|) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y~0=~y~0_In256755943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In256755943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In256755943} OutVars{~y$w_buff1~0=~y$w_buff1~0_In256755943, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out256755943|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out256755943|, ~y~0=~y~0_In256755943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In256755943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In256755943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:41:53,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In640887100 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In640887100 256) 0))) (or (and (= ~y$w_buff0_used~0_In640887100 |ULTIMATE.start_main_#t~ite60_Out640887100|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite60_Out640887100| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In640887100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640887100} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out640887100|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In640887100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640887100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 11:41:53,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In373670562 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In373670562 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In373670562 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In373670562 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In373670562 |ULTIMATE.start_main_#t~ite61_Out373670562|)) (and (= |ULTIMATE.start_main_#t~ite61_Out373670562| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In373670562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373670562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In373670562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373670562} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out373670562|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In373670562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In373670562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In373670562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In373670562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:41:53,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1310134971 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1310134971 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1310134971|)) (and (= ~y$r_buff0_thd0~0_In-1310134971 |ULTIMATE.start_main_#t~ite62_Out-1310134971|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310134971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310134971} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1310134971|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1310134971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1310134971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:41:53,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-997616385 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-997616385 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997616385 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-997616385 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-997616385| ~y$r_buff1_thd0~0_In-997616385) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out-997616385| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-997616385|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:41:53,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:41:53,604 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5077cd44-e75e-4e87-88dc-bc1e52a0588d/bin/uautomizer/witness.graphml [2019-12-07 11:41:53,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:41:53,605 INFO L168 Benchmark]: Toolchain (without parser) took 38402.17 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 942.5 MB in the beginning and 1.8 GB in the end (delta: -809.6 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,606 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:41:53,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:41:53,606 INFO L168 Benchmark]: Boogie Preprocessor took 26.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,607 INFO L168 Benchmark]: RCFGBuilder took 447.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,607 INFO L168 Benchmark]: TraceAbstraction took 37428.06 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -821.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,607 INFO L168 Benchmark]: Witness Printer took 76.32 ms. Allocated memory is still 5.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:53,608 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37428.06 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -821.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 76.32 ms. Allocated memory is still 5.1 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t174, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t175, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t176, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 37.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4126 SDtfs, 4326 SDslu, 6337 SDs, 0 SdLazy, 2027 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115674occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 153190 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 624 ConstructedInterpolants, 0 QuantifiedInterpolants, 194654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...