./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.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_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/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 669aca6fbd4d294f7aa9a9775b41f96f96c44568 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:39:52,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:39:52,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:39:52,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:39:52,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:39:52,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:39:52,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:39:52,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:39:52,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:39:52,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:39:52,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:39:52,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:39:52,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:39:52,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:39:52,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:39:52,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:39:52,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:39:52,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:39:52,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:39:52,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:39:52,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:39:52,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:39:52,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:39:52,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:39:52,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:39:52,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:39:52,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:39:52,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:39:52,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:39:52,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:39:52,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:39:52,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:39:52,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:39:52,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:39:52,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:39:52,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:39:52,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:39:52,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:39:52,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:39:52,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:39:52,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:39:52,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:39:52,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:39:52,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:39:52,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:39:52,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:39:52,622 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:39:52,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:39:52,622 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:39:52,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:39:52,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:39:52,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:39:52,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:39:52,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:39:52,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:39:52,623 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:39:52,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:39:52,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:39:52,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:39:52,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:39:52,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:39:52,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:39:52,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:39:52,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:39:52,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:39:52,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:39:52,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:39:52,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:39:52,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:39:52,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:39:52,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:39:52,626 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_010e472f-c868-4f70-af30-4f1a397f9710/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 -> 669aca6fbd4d294f7aa9a9775b41f96f96c44568 [2019-12-07 12:39:52,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:39:52,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:39:52,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:39:52,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:39:52,745 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:39:52,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i [2019-12-07 12:39:52,788 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/data/3e9bce279/d0f4da4f27914c538024bb8cef56c70c/FLAGb1c26c7a9 [2019-12-07 12:39:53,145 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:39:53,146 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i [2019-12-07 12:39:53,156 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/data/3e9bce279/d0f4da4f27914c538024bb8cef56c70c/FLAGb1c26c7a9 [2019-12-07 12:39:53,164 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/data/3e9bce279/d0f4da4f27914c538024bb8cef56c70c [2019-12-07 12:39:53,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:39:53,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:39:53,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:53,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:39:53,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:39:53,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53, skipping insertion in model container [2019-12-07 12:39:53,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:39:53,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:39:53,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:53,473 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:39:53,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:53,564 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:39:53,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53 WrapperNode [2019-12-07 12:39:53,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:53,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:53,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:39:53,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:39:53,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:53,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:39:53,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:39:53,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:39:53,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... [2019-12-07 12:39:53,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:39:53,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:39:53,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:39:53,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:39:53,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/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 12:39:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:39:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:39:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:39:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:39:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:39:53,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:39:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:39:53,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:39:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:39:53,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:39:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:39:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:39:53,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:39:53,698 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 12:39:54,084 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:39:54,085 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:39:54,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:54 BoogieIcfgContainer [2019-12-07 12:39:54,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:39:54,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:39:54,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:39:54,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:39:54,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:39:53" (1/3) ... [2019-12-07 12:39:54,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5490649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:54, skipping insertion in model container [2019-12-07 12:39:54,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:53" (2/3) ... [2019-12-07 12:39:54,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5490649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:54, skipping insertion in model container [2019-12-07 12:39:54,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:54" (3/3) ... [2019-12-07 12:39:54,090 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_pso.oepc.i [2019-12-07 12:39:54,096 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:39:54,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:39:54,101 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:39:54,102 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:39:54,158 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:39:54,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:39:54,171 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:39:54,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:39:54,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:39:54,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:39:54,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:39:54,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:39:54,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:39:54,182 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 12:39:54,184 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 12:39:54,239 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 12:39:54,239 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:39:54,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:39:54,265 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 12:39:54,293 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 12:39:54,293 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:39:54,298 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 12:39:54,314 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 12:39:54,315 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:39:57,267 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:39:57,364 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-07 12:39:57,364 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 12:39:57,366 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-07 12:40:10,185 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 12:40:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 12:40:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:40:10,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:10,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:40:10,191 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-07 12:40:10,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:10,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864454632] [2019-12-07 12:40:10,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:10,329 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 12:40:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864454632] [2019-12-07 12:40:10,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:10,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:40:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613616038] [2019-12-07 12:40:10,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:40:10,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:40:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:40:10,345 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 12:40:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:11,131 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-07 12:40:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:40:11,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:40:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:11,553 INFO L225 Difference]: With dead ends: 108680 [2019-12-07 12:40:11,553 INFO L226 Difference]: Without dead ends: 102440 [2019-12-07 12:40:11,554 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 12:40:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-07 12:40:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-07 12:40:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-07 12:40:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-07 12:40:18,593 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-07 12:40:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:18,593 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-07 12:40:18,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:40:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-07 12:40:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:40:18,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:18,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:18,597 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-07 12:40:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:18,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917950037] [2019-12-07 12:40:18,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:18,663 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 12:40:18,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917950037] [2019-12-07 12:40:18,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:18,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:40:18,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497011513] [2019-12-07 12:40:18,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:18,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:18,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:18,665 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-07 12:40:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:19,561 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-07 12:40:19,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:40:19,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:40:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:19,976 INFO L225 Difference]: With dead ends: 163248 [2019-12-07 12:40:19,976 INFO L226 Difference]: Without dead ends: 163199 [2019-12-07 12:40:19,977 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 12:40:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-07 12:40:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-07 12:40:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-07 12:40:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-07 12:40:27,610 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-07 12:40:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:27,611 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-07 12:40:27,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-07 12:40:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:40:27,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:27,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:27,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-07 12:40:27,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:27,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071277175] [2019-12-07 12:40:27,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:27,671 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 12:40:27,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071277175] [2019-12-07 12:40:27,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:27,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:40:27,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143882370] [2019-12-07 12:40:27,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:27,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:27,673 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-07 12:40:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:28,722 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-07 12:40:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:40:28,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:40:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:29,264 INFO L225 Difference]: With dead ends: 208779 [2019-12-07 12:40:29,264 INFO L226 Difference]: Without dead ends: 208723 [2019-12-07 12:40:29,264 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 12:40:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-07 12:40:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-07 12:40:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-07 12:40:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-07 12:40:39,743 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-07 12:40:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:39,743 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-07 12:40:39,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-07 12:40:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:40:39,751 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:39,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:39,751 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:39,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-07 12:40:39,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:39,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285560948] [2019-12-07 12:40:39,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:39,817 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 12:40:39,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285560948] [2019-12-07 12:40:39,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:39,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:40:39,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059481916] [2019-12-07 12:40:39,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:40:39,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:40:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:39,818 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-07 12:40:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:41,070 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-07 12:40:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:40:41,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 12:40:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:41,703 INFO L225 Difference]: With dead ends: 234922 [2019-12-07 12:40:41,703 INFO L226 Difference]: Without dead ends: 234922 [2019-12-07 12:40:41,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:40:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-07 12:40:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-07 12:40:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-07 12:40:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-07 12:40:53,102 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-07 12:40:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:53,103 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-07 12:40:53,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:40:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-07 12:40:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:40:53,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:53,114 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 12:40:53,114 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:53,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-07 12:40:53,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:53,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568625143] [2019-12-07 12:40:53,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:53,149 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 12:40:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568625143] [2019-12-07 12:40:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:53,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:40:53,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669031440] [2019-12-07 12:40:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:40:53,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:40:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:40:53,150 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-07 12:40:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:54,316 INFO L93 Difference]: Finished difference Result 184358 states and 747757 transitions. [2019-12-07 12:40:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:40:54,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:40:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:54,769 INFO L225 Difference]: With dead ends: 184358 [2019-12-07 12:40:54,769 INFO L226 Difference]: Without dead ends: 184358 [2019-12-07 12:40:54,769 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 12:40:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184358 states. [2019-12-07 12:41:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184358 to 181506. [2019-12-07 12:41:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181506 states. [2019-12-07 12:41:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181506 states to 181506 states and 737225 transitions. [2019-12-07 12:41:02,498 INFO L78 Accepts]: Start accepts. Automaton has 181506 states and 737225 transitions. Word has length 18 [2019-12-07 12:41:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:02,499 INFO L462 AbstractCegarLoop]: Abstraction has 181506 states and 737225 transitions. [2019-12-07 12:41:02,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 181506 states and 737225 transitions. [2019-12-07 12:41:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:41:02,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:02,508 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 12:41:02,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2087583439, now seen corresponding path program 1 times [2019-12-07 12:41:02,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:02,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965485778] [2019-12-07 12:41:02,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:02,551 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 12:41:02,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965485778] [2019-12-07 12:41:02,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:02,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:02,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222676728] [2019-12-07 12:41:02,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:02,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:02,553 INFO L87 Difference]: Start difference. First operand 181506 states and 737225 transitions. Second operand 4 states. [2019-12-07 12:41:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:03,083 INFO L93 Difference]: Finished difference Result 45669 states and 155577 transitions. [2019-12-07 12:41:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:41:03,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:41:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:03,135 INFO L225 Difference]: With dead ends: 45669 [2019-12-07 12:41:03,135 INFO L226 Difference]: Without dead ends: 34978 [2019-12-07 12:41:03,136 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 12:41:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34978 states. [2019-12-07 12:41:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34978 to 34978. [2019-12-07 12:41:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34978 states. [2019-12-07 12:41:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34978 states to 34978 states and 112197 transitions. [2019-12-07 12:41:03,699 INFO L78 Accepts]: Start accepts. Automaton has 34978 states and 112197 transitions. Word has length 18 [2019-12-07 12:41:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:03,699 INFO L462 AbstractCegarLoop]: Abstraction has 34978 states and 112197 transitions. [2019-12-07 12:41:03,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34978 states and 112197 transitions. [2019-12-07 12:41:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:41:03,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:03,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:03,704 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-07 12:41:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:03,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396129524] [2019-12-07 12:41:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:03,766 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 12:41:03,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396129524] [2019-12-07 12:41:03,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:03,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:03,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525874648] [2019-12-07 12:41:03,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:41:03,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:41:03,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:03,768 INFO L87 Difference]: Start difference. First operand 34978 states and 112197 transitions. Second operand 6 states. [2019-12-07 12:41:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:04,398 INFO L93 Difference]: Finished difference Result 53861 states and 168239 transitions. [2019-12-07 12:41:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:41:04,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 12:41:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:04,478 INFO L225 Difference]: With dead ends: 53861 [2019-12-07 12:41:04,478 INFO L226 Difference]: Without dead ends: 53805 [2019-12-07 12:41:04,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:41:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53805 states. [2019-12-07 12:41:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53805 to 35610. [2019-12-07 12:41:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35610 states. [2019-12-07 12:41:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35610 states to 35610 states and 113401 transitions. [2019-12-07 12:41:05,191 INFO L78 Accepts]: Start accepts. Automaton has 35610 states and 113401 transitions. Word has length 22 [2019-12-07 12:41:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:05,191 INFO L462 AbstractCegarLoop]: Abstraction has 35610 states and 113401 transitions. [2019-12-07 12:41:05,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:41:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35610 states and 113401 transitions. [2019-12-07 12:41:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:41:05,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:05,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:05,200 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-07 12:41:05,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:05,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582463559] [2019-12-07 12:41:05,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:05,253 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 12:41:05,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582463559] [2019-12-07 12:41:05,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:05,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:05,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133759627] [2019-12-07 12:41:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:05,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:05,254 INFO L87 Difference]: Start difference. First operand 35610 states and 113401 transitions. Second operand 5 states. [2019-12-07 12:41:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:05,659 INFO L93 Difference]: Finished difference Result 50652 states and 158066 transitions. [2019-12-07 12:41:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:41:05,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 12:41:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:05,733 INFO L225 Difference]: With dead ends: 50652 [2019-12-07 12:41:05,733 INFO L226 Difference]: Without dead ends: 50639 [2019-12-07 12:41:05,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50639 states. [2019-12-07 12:41:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50639 to 42618. [2019-12-07 12:41:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42618 states. [2019-12-07 12:41:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42618 states to 42618 states and 135190 transitions. [2019-12-07 12:41:06,485 INFO L78 Accepts]: Start accepts. Automaton has 42618 states and 135190 transitions. Word has length 25 [2019-12-07 12:41:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:06,486 INFO L462 AbstractCegarLoop]: Abstraction has 42618 states and 135190 transitions. [2019-12-07 12:41:06,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 42618 states and 135190 transitions. [2019-12-07 12:41:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:41:06,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:06,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:06,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:06,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:06,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-07 12:41:06,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:06,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958602997] [2019-12-07 12:41:06,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:06,637 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-07 12:41:06,668 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 12:41:06,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958602997] [2019-12-07 12:41:06,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:06,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:06,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941277181] [2019-12-07 12:41:06,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:41:06,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:41:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:06,670 INFO L87 Difference]: Start difference. First operand 42618 states and 135190 transitions. Second operand 6 states. [2019-12-07 12:41:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:07,141 INFO L93 Difference]: Finished difference Result 61046 states and 189200 transitions. [2019-12-07 12:41:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:41:07,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 12:41:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:07,223 INFO L225 Difference]: With dead ends: 61046 [2019-12-07 12:41:07,223 INFO L226 Difference]: Without dead ends: 60698 [2019-12-07 12:41:07,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:41:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60698 states. [2019-12-07 12:41:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60698 to 45797. [2019-12-07 12:41:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45797 states. [2019-12-07 12:41:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45797 states to 45797 states and 144643 transitions. [2019-12-07 12:41:08,045 INFO L78 Accepts]: Start accepts. Automaton has 45797 states and 144643 transitions. Word has length 27 [2019-12-07 12:41:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:08,045 INFO L462 AbstractCegarLoop]: Abstraction has 45797 states and 144643 transitions. [2019-12-07 12:41:08,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:41:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 45797 states and 144643 transitions. [2019-12-07 12:41:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:41:08,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:08,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:08,059 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1439082270, now seen corresponding path program 1 times [2019-12-07 12:41:08,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:08,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238248781] [2019-12-07 12:41:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:08,103 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 12:41:08,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238248781] [2019-12-07 12:41:08,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:08,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:41:08,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525253509] [2019-12-07 12:41:08,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:08,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:08,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:08,104 INFO L87 Difference]: Start difference. First operand 45797 states and 144643 transitions. Second operand 5 states. [2019-12-07 12:41:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:08,179 INFO L93 Difference]: Finished difference Result 20112 states and 60938 transitions. [2019-12-07 12:41:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:41:08,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 12:41:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:08,199 INFO L225 Difference]: With dead ends: 20112 [2019-12-07 12:41:08,199 INFO L226 Difference]: Without dead ends: 17577 [2019-12-07 12:41:08,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-07 12:41:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 16564. [2019-12-07 12:41:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16564 states. [2019-12-07 12:41:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 49915 transitions. [2019-12-07 12:41:08,429 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 49915 transitions. Word has length 29 [2019-12-07 12:41:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:08,429 INFO L462 AbstractCegarLoop]: Abstraction has 16564 states and 49915 transitions. [2019-12-07 12:41:08,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 49915 transitions. [2019-12-07 12:41:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:41:08,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:08,444 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 12:41:08,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-07 12:41:08,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:08,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125301526] [2019-12-07 12:41:08,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:08,501 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 12:41:08,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125301526] [2019-12-07 12:41:08,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:08,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:41:08,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56311052] [2019-12-07 12:41:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:41:08,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:41:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:08,502 INFO L87 Difference]: Start difference. First operand 16564 states and 49915 transitions. Second operand 7 states. [2019-12-07 12:41:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:09,110 INFO L93 Difference]: Finished difference Result 23459 states and 68690 transitions. [2019-12-07 12:41:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:41:09,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 12:41:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:09,132 INFO L225 Difference]: With dead ends: 23459 [2019-12-07 12:41:09,132 INFO L226 Difference]: Without dead ends: 22772 [2019-12-07 12:41:09,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:41:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22772 states. [2019-12-07 12:41:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22772 to 15927. [2019-12-07 12:41:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15927 states. [2019-12-07 12:41:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15927 states to 15927 states and 47844 transitions. [2019-12-07 12:41:09,391 INFO L78 Accepts]: Start accepts. Automaton has 15927 states and 47844 transitions. Word has length 33 [2019-12-07 12:41:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:09,392 INFO L462 AbstractCegarLoop]: Abstraction has 15927 states and 47844 transitions. [2019-12-07 12:41:09,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:41:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15927 states and 47844 transitions. [2019-12-07 12:41:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 12:41:09,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:09,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:09,410 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 731907862, now seen corresponding path program 1 times [2019-12-07 12:41:09,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:09,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057245953] [2019-12-07 12:41:09,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:09,461 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 12:41:09,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057245953] [2019-12-07 12:41:09,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:09,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:41:09,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021633162] [2019-12-07 12:41:09,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:41:09,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:41:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:09,462 INFO L87 Difference]: Start difference. First operand 15927 states and 47844 transitions. Second operand 5 states. [2019-12-07 12:41:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:09,823 INFO L93 Difference]: Finished difference Result 22680 states and 67761 transitions. [2019-12-07 12:41:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:41:09,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 12:41:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:09,846 INFO L225 Difference]: With dead ends: 22680 [2019-12-07 12:41:09,847 INFO L226 Difference]: Without dead ends: 22680 [2019-12-07 12:41:09,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22680 states. [2019-12-07 12:41:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22680 to 19953. [2019-12-07 12:41:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-07 12:41:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 60191 transitions. [2019-12-07 12:41:10,139 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 60191 transitions. Word has length 40 [2019-12-07 12:41:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:10,139 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 60191 transitions. [2019-12-07 12:41:10,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:41:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 60191 transitions. [2019-12-07 12:41:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 12:41:10,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:10,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:10,156 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1202471860, now seen corresponding path program 2 times [2019-12-07 12:41:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521927011] [2019-12-07 12:41:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:10,236 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 12:41:10,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521927011] [2019-12-07 12:41:10,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:10,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:10,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525098189] [2019-12-07 12:41:10,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:10,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:10,237 INFO L87 Difference]: Start difference. First operand 19953 states and 60191 transitions. Second operand 3 states. [2019-12-07 12:41:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:10,286 INFO L93 Difference]: Finished difference Result 19953 states and 59519 transitions. [2019-12-07 12:41:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:10,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 12:41:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:10,306 INFO L225 Difference]: With dead ends: 19953 [2019-12-07 12:41:10,306 INFO L226 Difference]: Without dead ends: 19953 [2019-12-07 12:41:10,307 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 12:41:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-07 12:41:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19507. [2019-12-07 12:41:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19507 states. [2019-12-07 12:41:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 58257 transitions. [2019-12-07 12:41:10,566 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 58257 transitions. Word has length 40 [2019-12-07 12:41:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:10,566 INFO L462 AbstractCegarLoop]: Abstraction has 19507 states and 58257 transitions. [2019-12-07 12:41:10,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 58257 transitions. [2019-12-07 12:41:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:41:10,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:10,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:10,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash 854921497, now seen corresponding path program 1 times [2019-12-07 12:41:10,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:10,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728922529] [2019-12-07 12:41:10,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:41:10,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728922529] [2019-12-07 12:41:10,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:10,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:41:10,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449842252] [2019-12-07 12:41:10,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:41:10,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:41:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:41:10,637 INFO L87 Difference]: Start difference. First operand 19507 states and 58257 transitions. Second operand 6 states. [2019-12-07 12:41:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:10,714 INFO L93 Difference]: Finished difference Result 18185 states and 55340 transitions. [2019-12-07 12:41:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:41:10,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 12:41:10,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:10,733 INFO L225 Difference]: With dead ends: 18185 [2019-12-07 12:41:10,733 INFO L226 Difference]: Without dead ends: 18034 [2019-12-07 12:41:10,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:41:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18034 states. [2019-12-07 12:41:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 16672. [2019-12-07 12:41:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-07 12:41:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 50949 transitions. [2019-12-07 12:41:10,968 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 50949 transitions. Word has length 41 [2019-12-07 12:41:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:10,968 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 50949 transitions. [2019-12-07 12:41:10,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:41:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 50949 transitions. [2019-12-07 12:41:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:41:10,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:10,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:10,983 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-07 12:41:10,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:10,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498890246] [2019-12-07 12:41:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:11,007 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 12:41:11,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498890246] [2019-12-07 12:41:11,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:11,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:11,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075877357] [2019-12-07 12:41:11,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:11,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:11,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:11,008 INFO L87 Difference]: Start difference. First operand 16672 states and 50949 transitions. Second operand 3 states. [2019-12-07 12:41:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:11,079 INFO L93 Difference]: Finished difference Result 23766 states and 72975 transitions. [2019-12-07 12:41:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:11,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:41:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:11,103 INFO L225 Difference]: With dead ends: 23766 [2019-12-07 12:41:11,103 INFO L226 Difference]: Without dead ends: 23766 [2019-12-07 12:41:11,104 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 12:41:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23766 states. [2019-12-07 12:41:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23766 to 18908. [2019-12-07 12:41:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18908 states. [2019-12-07 12:41:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 58542 transitions. [2019-12-07 12:41:11,402 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 58542 transitions. Word has length 66 [2019-12-07 12:41:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:11,402 INFO L462 AbstractCegarLoop]: Abstraction has 18908 states and 58542 transitions. [2019-12-07 12:41:11,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 58542 transitions. [2019-12-07 12:41:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:41:11,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:11,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:11,420 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-07 12:41:11,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:11,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201377093] [2019-12-07 12:41:11,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:11,445 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 12:41:11,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201377093] [2019-12-07 12:41:11,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:11,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:11,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15501361] [2019-12-07 12:41:11,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:11,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:11,447 INFO L87 Difference]: Start difference. First operand 18908 states and 58542 transitions. Second operand 3 states. [2019-12-07 12:41:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:11,525 INFO L93 Difference]: Finished difference Result 22628 states and 67954 transitions. [2019-12-07 12:41:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:11,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:41:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:11,549 INFO L225 Difference]: With dead ends: 22628 [2019-12-07 12:41:11,549 INFO L226 Difference]: Without dead ends: 22628 [2019-12-07 12:41:11,549 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 12:41:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22628 states. [2019-12-07 12:41:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22628 to 17579. [2019-12-07 12:41:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-12-07 12:41:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 52993 transitions. [2019-12-07 12:41:11,818 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 52993 transitions. Word has length 66 [2019-12-07 12:41:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:11,818 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 52993 transitions. [2019-12-07 12:41:11,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 52993 transitions. [2019-12-07 12:41:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:41:11,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:11,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:11,832 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-07 12:41:11,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:11,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129519436] [2019-12-07 12:41:11,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:11,898 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 12:41:11,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129519436] [2019-12-07 12:41:11,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:11,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:41:11,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468124554] [2019-12-07 12:41:11,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:41:11,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:41:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:11,899 INFO L87 Difference]: Start difference. First operand 17579 states and 52993 transitions. Second operand 7 states. [2019-12-07 12:41:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:12,605 INFO L93 Difference]: Finished difference Result 27087 states and 80193 transitions. [2019-12-07 12:41:12,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:41:12,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 12:41:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:12,634 INFO L225 Difference]: With dead ends: 27087 [2019-12-07 12:41:12,634 INFO L226 Difference]: Without dead ends: 27087 [2019-12-07 12:41:12,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:41:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27087 states. [2019-12-07 12:41:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27087 to 17891. [2019-12-07 12:41:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-07 12:41:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 53983 transitions. [2019-12-07 12:41:12,937 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 53983 transitions. Word has length 66 [2019-12-07 12:41:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:12,937 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 53983 transitions. [2019-12-07 12:41:12,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:41:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 53983 transitions. [2019-12-07 12:41:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:41:12,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:12,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:12,952 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1336131631, now seen corresponding path program 2 times [2019-12-07 12:41:12,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:12,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115369970] [2019-12-07 12:41:12,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:41:12,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115369970] [2019-12-07 12:41:12,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:12,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:41:12,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007929596] [2019-12-07 12:41:12,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:41:12,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:41:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:12,989 INFO L87 Difference]: Start difference. First operand 17891 states and 53983 transitions. Second operand 3 states. [2019-12-07 12:41:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:13,068 INFO L93 Difference]: Finished difference Result 20935 states and 63324 transitions. [2019-12-07 12:41:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:41:13,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 12:41:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:13,088 INFO L225 Difference]: With dead ends: 20935 [2019-12-07 12:41:13,088 INFO L226 Difference]: Without dead ends: 20935 [2019-12-07 12:41:13,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:41:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20935 states. [2019-12-07 12:41:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20935 to 15752. [2019-12-07 12:41:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-12-07 12:41:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 48027 transitions. [2019-12-07 12:41:13,379 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 48027 transitions. Word has length 66 [2019-12-07 12:41:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:13,379 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 48027 transitions. [2019-12-07 12:41:13,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:41:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 48027 transitions. [2019-12-07 12:41:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:13,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:13,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:13,392 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1394509299, now seen corresponding path program 1 times [2019-12-07 12:41:13,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:13,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016134468] [2019-12-07 12:41:13,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:13,430 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 12:41:13,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016134468] [2019-12-07 12:41:13,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:13,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:41:13,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191774056] [2019-12-07 12:41:13,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:41:13,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:41:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:41:13,431 INFO L87 Difference]: Start difference. First operand 15752 states and 48027 transitions. Second operand 4 states. [2019-12-07 12:41:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:13,509 INFO L93 Difference]: Finished difference Result 15580 states and 47314 transitions. [2019-12-07 12:41:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:41:13,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 12:41:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:13,526 INFO L225 Difference]: With dead ends: 15580 [2019-12-07 12:41:13,526 INFO L226 Difference]: Without dead ends: 15580 [2019-12-07 12:41:13,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:41:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15580 states. [2019-12-07 12:41:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15580 to 14091. [2019-12-07 12:41:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14091 states. [2019-12-07 12:41:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14091 states to 14091 states and 42650 transitions. [2019-12-07 12:41:13,734 INFO L78 Accepts]: Start accepts. Automaton has 14091 states and 42650 transitions. Word has length 67 [2019-12-07 12:41:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:13,735 INFO L462 AbstractCegarLoop]: Abstraction has 14091 states and 42650 transitions. [2019-12-07 12:41:13,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:41:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14091 states and 42650 transitions. [2019-12-07 12:41:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:13,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:13,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:13,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -869199490, now seen corresponding path program 1 times [2019-12-07 12:41:13,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:13,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294031538] [2019-12-07 12:41:13,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:13,812 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 12:41:13,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294031538] [2019-12-07 12:41:13,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:13,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:41:13,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133842678] [2019-12-07 12:41:13,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:41:13,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:13,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:41:13,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:41:13,813 INFO L87 Difference]: Start difference. First operand 14091 states and 42650 transitions. Second operand 7 states. [2019-12-07 12:41:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:14,066 INFO L93 Difference]: Finished difference Result 40160 states and 119247 transitions. [2019-12-07 12:41:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:41:14,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 12:41:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:14,097 INFO L225 Difference]: With dead ends: 40160 [2019-12-07 12:41:14,097 INFO L226 Difference]: Without dead ends: 29801 [2019-12-07 12:41:14,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:41:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29801 states. [2019-12-07 12:41:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29801 to 17052. [2019-12-07 12:41:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17052 states. [2019-12-07 12:41:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17052 states to 17052 states and 51361 transitions. [2019-12-07 12:41:14,410 INFO L78 Accepts]: Start accepts. Automaton has 17052 states and 51361 transitions. Word has length 67 [2019-12-07 12:41:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:14,410 INFO L462 AbstractCegarLoop]: Abstraction has 17052 states and 51361 transitions. [2019-12-07 12:41:14,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:41:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17052 states and 51361 transitions. [2019-12-07 12:41:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:14,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:14,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:14,424 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 2 times [2019-12-07 12:41:14,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:14,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737030064] [2019-12-07 12:41:14,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:14,829 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 12:41:14,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737030064] [2019-12-07 12:41:14,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:14,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 12:41:14,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060828572] [2019-12-07 12:41:14,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 12:41:14,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 12:41:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:41:14,830 INFO L87 Difference]: Start difference. First operand 17052 states and 51361 transitions. Second operand 18 states. [2019-12-07 12:41:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:22,726 INFO L93 Difference]: Finished difference Result 77581 states and 229181 transitions. [2019-12-07 12:41:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-07 12:41:22,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 12:41:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:22,803 INFO L225 Difference]: With dead ends: 77581 [2019-12-07 12:41:22,803 INFO L226 Difference]: Without dead ends: 68920 [2019-12-07 12:41:22,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1480, Invalid=9650, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 12:41:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68920 states. [2019-12-07 12:41:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68920 to 19388. [2019-12-07 12:41:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19388 states. [2019-12-07 12:41:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19388 states to 19388 states and 57906 transitions. [2019-12-07 12:41:23,377 INFO L78 Accepts]: Start accepts. Automaton has 19388 states and 57906 transitions. Word has length 67 [2019-12-07 12:41:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:23,377 INFO L462 AbstractCegarLoop]: Abstraction has 19388 states and 57906 transitions. [2019-12-07 12:41:23,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 12:41:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19388 states and 57906 transitions. [2019-12-07 12:41:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:23,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:23,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:23,394 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 3 times [2019-12-07 12:41:23,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:23,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55610101] [2019-12-07 12:41:23,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:23,519 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 12:41:23,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55610101] [2019-12-07 12:41:23,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:23,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:41:23,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591358057] [2019-12-07 12:41:23,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:41:23,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:41:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:41:23,520 INFO L87 Difference]: Start difference. First operand 19388 states and 57906 transitions. Second operand 11 states. [2019-12-07 12:41:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:24,267 INFO L93 Difference]: Finished difference Result 42581 states and 125873 transitions. [2019-12-07 12:41:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 12:41:24,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 12:41:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:24,297 INFO L225 Difference]: With dead ends: 42581 [2019-12-07 12:41:24,297 INFO L226 Difference]: Without dead ends: 28358 [2019-12-07 12:41:24,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 12:41:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28358 states. [2019-12-07 12:41:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28358 to 16338. [2019-12-07 12:41:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16338 states. [2019-12-07 12:41:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16338 states to 16338 states and 48601 transitions. [2019-12-07 12:41:24,600 INFO L78 Accepts]: Start accepts. Automaton has 16338 states and 48601 transitions. Word has length 67 [2019-12-07 12:41:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:24,600 INFO L462 AbstractCegarLoop]: Abstraction has 16338 states and 48601 transitions. [2019-12-07 12:41:24,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:41:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16338 states and 48601 transitions. [2019-12-07 12:41:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:24,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:24,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:24,614 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 4 times [2019-12-07 12:41:24,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:24,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356895718] [2019-12-07 12:41:24,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:41:24,796 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 12:41:24,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356895718] [2019-12-07 12:41:24,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:41:24,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:41:24,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278961828] [2019-12-07 12:41:24,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:41:24,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:41:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:41:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:41:24,797 INFO L87 Difference]: Start difference. First operand 16338 states and 48601 transitions. Second operand 13 states. [2019-12-07 12:41:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:41:26,090 INFO L93 Difference]: Finished difference Result 32872 states and 96612 transitions. [2019-12-07 12:41:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 12:41:26,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 12:41:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:41:26,126 INFO L225 Difference]: With dead ends: 32872 [2019-12-07 12:41:26,127 INFO L226 Difference]: Without dead ends: 31499 [2019-12-07 12:41:26,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:41:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31499 states. [2019-12-07 12:41:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31499 to 15808. [2019-12-07 12:41:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15808 states. [2019-12-07 12:41:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15808 states to 15808 states and 47129 transitions. [2019-12-07 12:41:26,490 INFO L78 Accepts]: Start accepts. Automaton has 15808 states and 47129 transitions. Word has length 67 [2019-12-07 12:41:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:41:26,490 INFO L462 AbstractCegarLoop]: Abstraction has 15808 states and 47129 transitions. [2019-12-07 12:41:26,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:41:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15808 states and 47129 transitions. [2019-12-07 12:41:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 12:41:26,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:41:26,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:41:26,503 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:41:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:41:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 5 times [2019-12-07 12:41:26,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:41:26,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181513785] [2019-12-07 12:41:26,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:41:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:41:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:41:26,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:41:26,586 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:41:26,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= 0 |v_ULTIMATE.start_main_~#t2399~0.offset_26|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39| 1)) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2399~0.base_39|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2399~0.base_39| 4)) (= v_~y~0_189 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39|) |v_ULTIMATE.start_main_~#t2399~0.offset_26| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39|)) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~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_785, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2399~0.offset=|v_ULTIMATE.start_main_~#t2399~0.offset_26|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2399~0.base=|v_ULTIMATE.start_main_~#t2399~0.base_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_25|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2400~0.base, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2399~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_~#t2399~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2401~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2401~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2400~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:26,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:26,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2400~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11|) |v_ULTIMATE.start_main_~#t2400~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2400~0.base_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11| 1) |v_#valid_39|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2400~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2400~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2400~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t2400~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:41:26,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11|) |v_ULTIMATE.start_main_~#t2401~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2401~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2401~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2401~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2401~0.base] because there is no mapped edge [2019-12-07 12:41:26,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In283203836 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out283203836| ~y$w_buff1~0_In283203836) (= |P2Thread1of1ForFork2_#t~ite24_Out283203836| |P2Thread1of1ForFork2_#t~ite23_Out283203836|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In283203836 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In283203836 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In283203836 256))) (= (mod ~y$w_buff0_used~0_In283203836 256) 0)))) (and (= |P2Thread1of1ForFork2_#t~ite24_Out283203836| ~y$w_buff1~0_In283203836) (= |P2Thread1of1ForFork2_#t~ite23_In283203836| |P2Thread1of1ForFork2_#t~ite23_Out283203836|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In283203836|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In283203836, ~y$w_buff1~0=~y$w_buff1~0_In283203836, ~y$w_buff0_used~0=~y$w_buff0_used~0_In283203836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In283203836, ~weak$$choice2~0=~weak$$choice2~0_In283203836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In283203836} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out283203836|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out283203836|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In283203836, ~y$w_buff1~0=~y$w_buff1~0_In283203836, ~y$w_buff0_used~0=~y$w_buff0_used~0_In283203836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In283203836, ~weak$$choice2~0=~weak$$choice2~0_In283203836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In283203836} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:41:26,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1995149116 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out1995149116| ~y$w_buff0_used~0_In1995149116) (= |P2Thread1of1ForFork2_#t~ite26_Out1995149116| |P2Thread1of1ForFork2_#t~ite27_Out1995149116|) (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1995149116 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1995149116 256)) .cse0) (and (= (mod ~y$r_buff1_thd3~0_In1995149116 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1995149116 256) 0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In1995149116| |P2Thread1of1ForFork2_#t~ite26_Out1995149116|) (= ~y$w_buff0_used~0_In1995149116 |P2Thread1of1ForFork2_#t~ite27_Out1995149116|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1995149116, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1995149116|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995149116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1995149116, ~weak$$choice2~0=~weak$$choice2~0_In1995149116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995149116} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1995149116|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1995149116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995149116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1995149116, ~weak$$choice2~0=~weak$$choice2~0_In1995149116, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1995149116|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995149116} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 12:41:26,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In440452248 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In440452248| |P2Thread1of1ForFork2_#t~ite29_Out440452248|) (= ~y$w_buff1_used~0_In440452248 |P2Thread1of1ForFork2_#t~ite30_Out440452248|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out440452248| |P2Thread1of1ForFork2_#t~ite29_Out440452248|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In440452248 256)))) (or (and (= 0 (mod ~y$r_buff1_thd3~0_In440452248 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In440452248 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In440452248 256)))) (= ~y$w_buff1_used~0_In440452248 |P2Thread1of1ForFork2_#t~ite29_Out440452248|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In440452248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440452248, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In440452248, ~weak$$choice2~0=~weak$$choice2~0_In440452248, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In440452248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440452248} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In440452248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440452248, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out440452248|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In440452248, ~weak$$choice2~0=~weak$$choice2~0_In440452248, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out440452248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440452248} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:41:26,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 12:41:26,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:41:26,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In466728357 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In466728357 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out466728357| ~y$w_buff1~0_In466728357) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out466728357| ~y~0_In466728357)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In466728357, ~y$w_buff1~0=~y$w_buff1~0_In466728357, ~y~0=~y~0_In466728357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466728357} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In466728357, ~y$w_buff1~0=~y$w_buff1~0_In466728357, ~y~0=~y~0_In466728357, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out466728357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466728357} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:41:26,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2115763753 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2115763753 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2115763753| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2115763753| ~y$w_buff0_used~0_In2115763753) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2115763753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115763753} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2115763753|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115763753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115763753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:41:26,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1607459823 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1607459823 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1607459823 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1607459823 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1607459823| ~y$w_buff1_used~0_In-1607459823) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1607459823| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1607459823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1607459823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1607459823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1607459823} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1607459823|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1607459823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1607459823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1607459823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1607459823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:41:26,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-36431165| |P1Thread1of1ForFork1_#t~ite9_Out-36431165|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-36431165 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-36431165 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-36431165 |P1Thread1of1ForFork1_#t~ite9_Out-36431165|)) (and .cse1 (= ~y~0_In-36431165 |P1Thread1of1ForFork1_#t~ite9_Out-36431165|) (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-36431165, ~y$w_buff1~0=~y$w_buff1~0_In-36431165, ~y~0=~y~0_In-36431165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36431165} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-36431165, ~y$w_buff1~0=~y$w_buff1~0_In-36431165, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-36431165|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-36431165|, ~y~0=~y~0_In-36431165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36431165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 12:41:26,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:41:26,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1064713212 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1064713212 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1064713212| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1064713212| ~y$w_buff0_used~0_In1064713212)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1064713212, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1064713212} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1064713212, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1064713212, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1064713212|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 12:41:26,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-332330525 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-332330525 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-332330525 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-332330525 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-332330525 |P2Thread1of1ForFork2_#t~ite41_Out-332330525|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-332330525|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-332330525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-332330525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-332330525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-332330525} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-332330525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-332330525, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-332330525|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-332330525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-332330525} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 12:41:26,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1792641108 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1792641108 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1792641108| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1792641108| ~y$r_buff0_thd3~0_In-1792641108)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792641108, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792641108} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792641108, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1792641108|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792641108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In730952048 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In730952048 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In730952048 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In730952048 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In730952048 |P2Thread1of1ForFork2_#t~ite43_Out730952048|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out730952048|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730952048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730952048, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730952048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730952048} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730952048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730952048, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730952048, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out730952048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730952048} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In734023225 256) 0)) (.cse0 (= ~y$r_buff0_thd1~0_Out734023225 ~y$r_buff0_thd1~0_In734023225)) (.cse2 (= (mod ~y$w_buff0_used~0_In734023225 256) 0))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out734023225 0) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In734023225, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734023225} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In734023225, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out734023225|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out734023225} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1381004778 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1381004778 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1381004778 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1381004778 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1381004778|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1381004778 |P0Thread1of1ForFork0_#t~ite8_Out1381004778|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1381004778, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381004778, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1381004778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381004778} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1381004778, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381004778, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1381004778|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1381004778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381004778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:41:26,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1915576892 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1915576892 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1915576892|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1915576892| ~y$w_buff0_used~0_In-1915576892) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915576892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1915576892} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915576892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1915576892, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1915576892|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:41:26,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In48365534 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In48365534 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In48365534 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In48365534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In48365534 |P1Thread1of1ForFork1_#t~ite12_Out48365534|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out48365534| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In48365534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In48365534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In48365534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In48365534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In48365534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In48365534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In48365534, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out48365534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In48365534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:41:26,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1005044401 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1005044401 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1005044401| ~y$r_buff0_thd2~0_In-1005044401)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1005044401|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005044401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1005044401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005044401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1005044401, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1005044401|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 12:41:26,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-211971094 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-211971094 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-211971094 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-211971094 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-211971094| ~y$r_buff1_thd2~0_In-211971094)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-211971094|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-211971094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211971094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-211971094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211971094} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-211971094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211971094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-211971094, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-211971094|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211971094} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:41:26,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:41:26,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:41:26,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1285264115 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1285264115 256)))) (or (and (= ~y~0_In-1285264115 |ULTIMATE.start_main_#t~ite47_Out-1285264115|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1285264115 |ULTIMATE.start_main_#t~ite47_Out-1285264115|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1285264115, ~y~0=~y~0_In-1285264115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285264115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285264115} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1285264115, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1285264115|, ~y~0=~y~0_In-1285264115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285264115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285264115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:41:26,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 12:41:26,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-379530739 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-379530739 256) 0))) (or (and (= ~y$w_buff0_used~0_In-379530739 |ULTIMATE.start_main_#t~ite49_Out-379530739|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-379530739|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-379530739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-379530739} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-379530739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-379530739, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-379530739|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 12:41:26,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1559260614 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1559260614 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1559260614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1559260614 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1559260614 |ULTIMATE.start_main_#t~ite50_Out1559260614|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1559260614|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1559260614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559260614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1559260614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1559260614} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1559260614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1559260614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559260614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1559260614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1559260614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 12:41:26,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In116672471 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In116672471 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out116672471| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out116672471| ~y$r_buff0_thd0~0_In116672471) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In116672471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116672471} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out116672471|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In116672471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116672471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 12:41:26,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In659112573 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In659112573 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In659112573 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In659112573 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out659112573| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out659112573| ~y$r_buff1_thd0~0_In659112573) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In659112573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In659112573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659112573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659112573} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out659112573|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659112573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In659112573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659112573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659112573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 12:41:26,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, 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 12:41:26,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:41:26 BasicIcfg [2019-12-07 12:41:26,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:41:26,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:41:26,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:41:26,664 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:41:26,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:54" (3/4) ... [2019-12-07 12:41:26,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:41:26,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= 0 |v_ULTIMATE.start_main_~#t2399~0.offset_26|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39| 1)) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2399~0.base_39|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2399~0.base_39| 4)) (= v_~y~0_189 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39|) |v_ULTIMATE.start_main_~#t2399~0.offset_26| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39|)) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~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_785, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2399~0.offset=|v_ULTIMATE.start_main_~#t2399~0.offset_26|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2399~0.base=|v_ULTIMATE.start_main_~#t2399~0.base_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_25|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2400~0.base, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2399~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_~#t2399~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2401~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2401~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2400~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:26,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:41:26,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2400~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11|) |v_ULTIMATE.start_main_~#t2400~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2400~0.base_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11| 1) |v_#valid_39|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2400~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2400~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2400~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t2400~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:41:26,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11|) |v_ULTIMATE.start_main_~#t2401~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2401~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2401~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2401~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2401~0.base] because there is no mapped edge [2019-12-07 12:41:26,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In283203836 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out283203836| ~y$w_buff1~0_In283203836) (= |P2Thread1of1ForFork2_#t~ite24_Out283203836| |P2Thread1of1ForFork2_#t~ite23_Out283203836|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In283203836 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd3~0_In283203836 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In283203836 256))) (= (mod ~y$w_buff0_used~0_In283203836 256) 0)))) (and (= |P2Thread1of1ForFork2_#t~ite24_Out283203836| ~y$w_buff1~0_In283203836) (= |P2Thread1of1ForFork2_#t~ite23_In283203836| |P2Thread1of1ForFork2_#t~ite23_Out283203836|) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In283203836|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In283203836, ~y$w_buff1~0=~y$w_buff1~0_In283203836, ~y$w_buff0_used~0=~y$w_buff0_used~0_In283203836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In283203836, ~weak$$choice2~0=~weak$$choice2~0_In283203836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In283203836} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out283203836|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out283203836|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In283203836, ~y$w_buff1~0=~y$w_buff1~0_In283203836, ~y$w_buff0_used~0=~y$w_buff0_used~0_In283203836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In283203836, ~weak$$choice2~0=~weak$$choice2~0_In283203836, ~y$w_buff1_used~0=~y$w_buff1_used~0_In283203836} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:41:26,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1995149116 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out1995149116| ~y$w_buff0_used~0_In1995149116) (= |P2Thread1of1ForFork2_#t~ite26_Out1995149116| |P2Thread1of1ForFork2_#t~ite27_Out1995149116|) (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1995149116 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1995149116 256)) .cse0) (and (= (mod ~y$r_buff1_thd3~0_In1995149116 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1995149116 256) 0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In1995149116| |P2Thread1of1ForFork2_#t~ite26_Out1995149116|) (= ~y$w_buff0_used~0_In1995149116 |P2Thread1of1ForFork2_#t~ite27_Out1995149116|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1995149116, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1995149116|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995149116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1995149116, ~weak$$choice2~0=~weak$$choice2~0_In1995149116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995149116} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1995149116|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1995149116, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1995149116, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1995149116, ~weak$$choice2~0=~weak$$choice2~0_In1995149116, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1995149116|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1995149116} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 12:41:26,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In440452248 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In440452248| |P2Thread1of1ForFork2_#t~ite29_Out440452248|) (= ~y$w_buff1_used~0_In440452248 |P2Thread1of1ForFork2_#t~ite30_Out440452248|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out440452248| |P2Thread1of1ForFork2_#t~ite29_Out440452248|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In440452248 256)))) (or (and (= 0 (mod ~y$r_buff1_thd3~0_In440452248 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In440452248 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In440452248 256)))) (= ~y$w_buff1_used~0_In440452248 |P2Thread1of1ForFork2_#t~ite29_Out440452248|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In440452248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440452248, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In440452248, ~weak$$choice2~0=~weak$$choice2~0_In440452248, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In440452248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440452248} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In440452248, ~y$w_buff0_used~0=~y$w_buff0_used~0_In440452248, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out440452248|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In440452248, ~weak$$choice2~0=~weak$$choice2~0_In440452248, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out440452248|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In440452248} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:41:26,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 12:41:26,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:41:26,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In466728357 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In466728357 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out466728357| ~y$w_buff1~0_In466728357) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out466728357| ~y~0_In466728357)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In466728357, ~y$w_buff1~0=~y$w_buff1~0_In466728357, ~y~0=~y~0_In466728357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466728357} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In466728357, ~y$w_buff1~0=~y$w_buff1~0_In466728357, ~y~0=~y~0_In466728357, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out466728357|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466728357} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:41:26,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2115763753 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2115763753 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2115763753| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2115763753| ~y$w_buff0_used~0_In2115763753) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2115763753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115763753} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2115763753|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2115763753, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2115763753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:41:26,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1607459823 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1607459823 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1607459823 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1607459823 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1607459823| ~y$w_buff1_used~0_In-1607459823) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1607459823| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1607459823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1607459823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1607459823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1607459823} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1607459823|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1607459823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1607459823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1607459823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1607459823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:41:26,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out-36431165| |P1Thread1of1ForFork1_#t~ite9_Out-36431165|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-36431165 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-36431165 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-36431165 |P1Thread1of1ForFork1_#t~ite9_Out-36431165|)) (and .cse1 (= ~y~0_In-36431165 |P1Thread1of1ForFork1_#t~ite9_Out-36431165|) (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-36431165, ~y$w_buff1~0=~y$w_buff1~0_In-36431165, ~y~0=~y~0_In-36431165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36431165} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-36431165, ~y$w_buff1~0=~y$w_buff1~0_In-36431165, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-36431165|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-36431165|, ~y~0=~y~0_In-36431165, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36431165} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 12:41:26,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 12:41:26,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1064713212 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1064713212 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1064713212| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite40_Out1064713212| ~y$w_buff0_used~0_In1064713212)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1064713212, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1064713212} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1064713212, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1064713212, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1064713212|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 12:41:26,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-332330525 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-332330525 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-332330525 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-332330525 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-332330525 |P2Thread1of1ForFork2_#t~ite41_Out-332330525|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-332330525|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-332330525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-332330525, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-332330525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-332330525} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-332330525, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-332330525, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-332330525|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-332330525, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-332330525} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 12:41:26,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1792641108 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1792641108 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1792641108| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-1792641108| ~y$r_buff0_thd3~0_In-1792641108)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792641108, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792641108} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792641108, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1792641108|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1792641108} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In730952048 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In730952048 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In730952048 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In730952048 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In730952048 |P2Thread1of1ForFork2_#t~ite43_Out730952048|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out730952048|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730952048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730952048, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730952048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730952048} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In730952048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In730952048, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In730952048, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out730952048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In730952048} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In734023225 256) 0)) (.cse0 (= ~y$r_buff0_thd1~0_Out734023225 ~y$r_buff0_thd1~0_In734023225)) (.cse2 (= (mod ~y$w_buff0_used~0_In734023225 256) 0))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out734023225 0) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In734023225, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734023225} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In734023225, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out734023225|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out734023225} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1381004778 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1381004778 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1381004778 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1381004778 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1381004778|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1381004778 |P0Thread1of1ForFork0_#t~ite8_Out1381004778|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1381004778, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381004778, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1381004778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381004778} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1381004778, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1381004778, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1381004778|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1381004778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1381004778} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:41:26,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1915576892 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1915576892 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1915576892|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1915576892| ~y$w_buff0_used~0_In-1915576892) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915576892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1915576892} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1915576892, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1915576892, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1915576892|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 12:41:26,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In48365534 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In48365534 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In48365534 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In48365534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In48365534 |P1Thread1of1ForFork1_#t~ite12_Out48365534|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out48365534| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In48365534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In48365534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In48365534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In48365534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In48365534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In48365534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In48365534, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out48365534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In48365534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:41:26,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1005044401 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1005044401 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1005044401| ~y$r_buff0_thd2~0_In-1005044401)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1005044401|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005044401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1005044401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1005044401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1005044401, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1005044401|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-211971094 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-211971094 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-211971094 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-211971094 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-211971094| ~y$r_buff1_thd2~0_In-211971094)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-211971094|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-211971094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211971094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-211971094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211971094} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-211971094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211971094, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-211971094, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-211971094|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211971094} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1285264115 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1285264115 256)))) (or (and (= ~y~0_In-1285264115 |ULTIMATE.start_main_#t~ite47_Out-1285264115|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1285264115 |ULTIMATE.start_main_#t~ite47_Out-1285264115|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1285264115, ~y~0=~y~0_In-1285264115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285264115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285264115} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1285264115, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1285264115|, ~y~0=~y~0_In-1285264115, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1285264115, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285264115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 12:41:26,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-379530739 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-379530739 256) 0))) (or (and (= ~y$w_buff0_used~0_In-379530739 |ULTIMATE.start_main_#t~ite49_Out-379530739|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-379530739|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-379530739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-379530739} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-379530739, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-379530739, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-379530739|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 12:41:26,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1559260614 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1559260614 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1559260614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1559260614 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1559260614 |ULTIMATE.start_main_#t~ite50_Out1559260614|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1559260614|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1559260614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559260614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1559260614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1559260614} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1559260614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1559260614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559260614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1559260614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1559260614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 12:41:26,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In116672471 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In116672471 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out116672471| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out116672471| ~y$r_buff0_thd0~0_In116672471) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In116672471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116672471} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out116672471|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In116672471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In116672471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 12:41:26,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In659112573 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In659112573 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In659112573 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In659112573 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out659112573| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out659112573| ~y$r_buff1_thd0~0_In659112573) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In659112573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In659112573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659112573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659112573} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out659112573|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659112573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In659112573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659112573, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659112573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 12:41:26,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, 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 12:41:26,739 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_010e472f-c868-4f70-af30-4f1a397f9710/bin/uautomizer/witness.graphml [2019-12-07 12:41:26,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:41:26,740 INFO L168 Benchmark]: Toolchain (without parser) took 93573.29 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 935.3 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 12:41:26,741 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:41:26,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:26,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.20 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 12:41:26,742 INFO L168 Benchmark]: Boogie Preprocessor took 34.12 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 12:41:26,742 INFO L168 Benchmark]: RCFGBuilder took 437.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:26,743 INFO L168 Benchmark]: TraceAbstraction took 92577.93 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 998.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 12:41:26,743 INFO L168 Benchmark]: Witness Printer took 75.04 ms. Allocated memory is still 6.9 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:41:26,745 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.12 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 437.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92577.93 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 998.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 75.04 ms. Allocated memory is still 6.9 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2399, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2400, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2401, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !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) [L781] 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_p2_EAX=2, __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=8, weak$$choice2=1, 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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L786] 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_p2_EAX=2, __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=8, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 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)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 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, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5259 SDtfs, 7291 SDslu, 18890 SDs, 0 SdLazy, 14497 SolverSat, 366 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 36 SyntacticMatches, 18 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195490occurred 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: 51.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 258848 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 912 ConstructedInterpolants, 0 QuantifiedInterpolants, 207959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...