./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.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_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/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 0ba5a5bdf8f08b1320bf872d694c60d00e440ad8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:06:59,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:06:59,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:06:59,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:06:59,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:06:59,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:06:59,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:06:59,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:06:59,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:06:59,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:06:59,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:06:59,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:06:59,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:06:59,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:06:59,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:06:59,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:06:59,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:06:59,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:06:59,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:06:59,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:06:59,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:06:59,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:06:59,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:06:59,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:06:59,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:06:59,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:06:59,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:06:59,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:06:59,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:06:59,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:06:59,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:06:59,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:06:59,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:06:59,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:06:59,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:06:59,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:06:59,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:06:59,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:06:59,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:06:59,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:06:59,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:06:59,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:06:59,159 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:06:59,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:06:59,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:06:59,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:06:59,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:06:59,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:06:59,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:06:59,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:06:59,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:06:59,162 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_cc7b6aee-1bbd-4227-92cf-693030708733/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 -> 0ba5a5bdf8f08b1320bf872d694c60d00e440ad8 [2019-12-07 18:06:59,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:06:59,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:06:59,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:06:59,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:06:59,274 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:06:59,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_rmo.oepc.i [2019-12-07 18:06:59,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/data/8ded52e6b/a90594b1998e46f5ae6ae138cf9d9b30/FLAG884017541 [2019-12-07 18:06:59,788 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:06:59,789 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/sv-benchmarks/c/pthread-wmm/mix032_rmo.oepc.i [2019-12-07 18:06:59,799 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/data/8ded52e6b/a90594b1998e46f5ae6ae138cf9d9b30/FLAG884017541 [2019-12-07 18:06:59,811 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/data/8ded52e6b/a90594b1998e46f5ae6ae138cf9d9b30 [2019-12-07 18:06:59,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:06:59,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:06:59,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:06:59,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:06:59,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:06:59,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:06:59" (1/1) ... [2019-12-07 18:06:59,819 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 06:06:59, skipping insertion in model container [2019-12-07 18:06:59,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:06:59" (1/1) ... [2019-12-07 18:06:59,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:06:59,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:07:00,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:07:00,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:07:00,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:07:00,203 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:07:00,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00 WrapperNode [2019-12-07 18:07:00,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:07:00,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:07:00,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:07:00,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:07:00,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:07:00,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:07:00,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:07:00,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:07:00,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... [2019-12-07 18:07:00,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:07:00,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:07:00,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:07:00,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:07:00,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/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 18:07:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:07:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:07:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:07:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:07:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:07:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:07:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:07:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:07:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:07:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:07:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:07:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:07:00,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:07:00,314 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 18:07:00,682 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:07:00,683 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:07:00,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:00 BoogieIcfgContainer [2019-12-07 18:07:00,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:07:00,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:07:00,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:07:00,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:07:00,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:06:59" (1/3) ... [2019-12-07 18:07:00,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cf4741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:07:00, skipping insertion in model container [2019-12-07 18:07:00,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:00" (2/3) ... [2019-12-07 18:07:00,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cf4741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:07:00, skipping insertion in model container [2019-12-07 18:07:00,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:00" (3/3) ... [2019-12-07 18:07:00,690 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2019-12-07 18:07:00,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:07:00,699 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:07:00,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:07:00,706 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:07:00,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,744 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:00,775 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:07:00,787 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:07:00,787 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:07:00,787 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:07:00,787 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:07:00,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:07:00,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:07:00,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:07:00,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:07:00,798 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 18:07:00,799 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 18:07:00,853 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 18:07:00,854 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:07:00,864 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:07:00,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 18:07:00,911 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 18:07:00,911 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:07:00,916 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:07:00,934 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 18:07:00,935 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:07:03,863 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 18:07:04,045 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:07:04,154 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-07 18:07:04,154 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 18:07:04,156 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-07 18:07:22,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-07 18:07:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-07 18:07:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:07:22,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:22,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:07:22,020 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 18:07:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-07 18:07:22,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:22,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029326703] [2019-12-07 18:07:22,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,167 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 18:07:22,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029326703] [2019-12-07 18:07:22,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:07:22,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437713252] [2019-12-07 18:07:22,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:22,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:22,183 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-07 18:07:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:23,054 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-07 18:07:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:23,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:07:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:23,533 INFO L225 Difference]: With dead ends: 128376 [2019-12-07 18:07:23,534 INFO L226 Difference]: Without dead ends: 120914 [2019-12-07 18:07:23,534 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 18:07:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-07 18:07:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-07 18:07:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-07 18:07:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-07 18:07:32,036 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-07 18:07:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:32,037 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-07 18:07:32,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-07 18:07:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:07:32,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:32,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:32,040 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 18:07:32,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-07 18:07:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:32,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169836849] [2019-12-07 18:07:32,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:32,098 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 18:07:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169836849] [2019-12-07 18:07:32,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956704746] [2019-12-07 18:07:32,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:32,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:32,100 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-07 18:07:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:33,091 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-07 18:07:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:33,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:07:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:33,572 INFO L225 Difference]: With dead ends: 187704 [2019-12-07 18:07:33,572 INFO L226 Difference]: Without dead ends: 187655 [2019-12-07 18:07:33,573 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 18:07:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-07 18:07:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-07 18:07:44,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-07 18:07:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-07 18:07:44,953 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-07 18:07:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,953 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-07 18:07:44,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-07 18:07:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:07:44,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:44,958 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 18:07:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-07 18:07:44,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234952417] [2019-12-07 18:07:44,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:45,011 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 18:07:45,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234952417] [2019-12-07 18:07:45,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:45,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:45,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374570454] [2019-12-07 18:07:45,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:45,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:45,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:45,013 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 4 states. [2019-12-07 18:07:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:46,238 INFO L93 Difference]: Finished difference Result 242262 states and 982161 transitions. [2019-12-07 18:07:46,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:46,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:07:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:47,432 INFO L225 Difference]: With dead ends: 242262 [2019-12-07 18:07:47,432 INFO L226 Difference]: Without dead ends: 242206 [2019-12-07 18:07:47,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:07:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242206 states. [2019-12-07 18:08:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242206 to 205026. [2019-12-07 18:08:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205026 states. [2019-12-07 18:08:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205026 states to 205026 states and 845145 transitions. [2019-12-07 18:08:00,649 INFO L78 Accepts]: Start accepts. Automaton has 205026 states and 845145 transitions. Word has length 13 [2019-12-07 18:08:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:00,650 INFO L462 AbstractCegarLoop]: Abstraction has 205026 states and 845145 transitions. [2019-12-07 18:08:00,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 205026 states and 845145 transitions. [2019-12-07 18:08:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:08:00,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:00,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:00,658 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 18:08:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-07 18:08:00,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:00,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046772652] [2019-12-07 18:08:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:00,710 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 18:08:00,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046772652] [2019-12-07 18:08:00,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:00,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:00,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200992602] [2019-12-07 18:08:00,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:00,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:00,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:00,712 INFO L87 Difference]: Start difference. First operand 205026 states and 845145 transitions. Second operand 5 states. [2019-12-07 18:08:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:02,131 INFO L93 Difference]: Finished difference Result 278815 states and 1138912 transitions. [2019-12-07 18:08:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:08:02,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:08:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:02,884 INFO L225 Difference]: With dead ends: 278815 [2019-12-07 18:08:02,884 INFO L226 Difference]: Without dead ends: 278815 [2019-12-07 18:08:02,884 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 18:08:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278815 states. [2019-12-07 18:08:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278815 to 233994. [2019-12-07 18:08:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233994 states. [2019-12-07 18:08:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233994 states to 233994 states and 963338 transitions. [2019-12-07 18:08:18,088 INFO L78 Accepts]: Start accepts. Automaton has 233994 states and 963338 transitions. Word has length 16 [2019-12-07 18:08:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:18,088 INFO L462 AbstractCegarLoop]: Abstraction has 233994 states and 963338 transitions. [2019-12-07 18:08:18,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 233994 states and 963338 transitions. [2019-12-07 18:08:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:08:18,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:18,102 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 18:08:18,102 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 18:08:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1320991791, now seen corresponding path program 1 times [2019-12-07 18:08:18,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:18,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742122801] [2019-12-07 18:08:18,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:18,136 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 18:08:18,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742122801] [2019-12-07 18:08:18,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:18,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:18,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245647710] [2019-12-07 18:08:18,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:18,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:18,138 INFO L87 Difference]: Start difference. First operand 233994 states and 963338 transitions. Second operand 3 states. [2019-12-07 18:08:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:18,264 INFO L93 Difference]: Finished difference Result 43149 states and 139668 transitions. [2019-12-07 18:08:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:18,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:08:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:18,329 INFO L225 Difference]: With dead ends: 43149 [2019-12-07 18:08:18,329 INFO L226 Difference]: Without dead ends: 43149 [2019-12-07 18:08:18,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43149 states. [2019-12-07 18:08:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43149 to 43029. [2019-12-07 18:08:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-07 18:08:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-07 18:08:19,043 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 18 [2019-12-07 18:08:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:19,044 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-07 18:08:19,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-07 18:08:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:08:19,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:19,049 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 18:08:19,049 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 18:08:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-07 18:08:19,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:19,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890371069] [2019-12-07 18:08:19,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:19,115 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 18:08:19,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890371069] [2019-12-07 18:08:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:19,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152752549] [2019-12-07 18:08:19,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:08:19,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:08:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:19,117 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-07 18:08:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:19,682 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-07 18:08:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:08:19,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:08:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:19,777 INFO L225 Difference]: With dead ends: 64122 [2019-12-07 18:08:19,777 INFO L226 Difference]: Without dead ends: 64115 [2019-12-07 18:08:19,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:08:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-07 18:08:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-07 18:08:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-07 18:08:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-07 18:08:21,063 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-07 18:08:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:21,063 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-07 18:08:21,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:08:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-07 18:08:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:08:21,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:21,071 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 18:08:21,071 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 18:08:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-07 18:08:21,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:21,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423948122] [2019-12-07 18:08:21,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:21,111 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 18:08:21,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423948122] [2019-12-07 18:08:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587766455] [2019-12-07 18:08:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:21,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:21,113 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-07 18:08:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:21,171 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-07 18:08:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:21,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 18:08:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:21,189 INFO L225 Difference]: With dead ends: 17024 [2019-12-07 18:08:21,189 INFO L226 Difference]: Without dead ends: 17024 [2019-12-07 18:08:21,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-07 18:08:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-07 18:08:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-07 18:08:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-07 18:08:21,431 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-07 18:08:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:21,431 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-07 18:08:21,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-07 18:08:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:08:21,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:21,442 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 18:08:21,442 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 18:08:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-07 18:08:21,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:21,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142110595] [2019-12-07 18:08:21,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:21,470 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 18:08:21,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142110595] [2019-12-07 18:08:21,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:21,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:21,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746051272] [2019-12-07 18:08:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:21,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:21,471 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-07 18:08:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:21,564 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-07 18:08:21,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:21,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:08:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:21,590 INFO L225 Difference]: With dead ends: 24375 [2019-12-07 18:08:21,590 INFO L226 Difference]: Without dead ends: 24375 [2019-12-07 18:08:21,591 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 18:08:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-07 18:08:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-07 18:08:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-07 18:08:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-07 18:08:21,890 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-07 18:08:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:21,891 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-07 18:08:21,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-07 18:08:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:08:21,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:21,902 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 18:08:21,902 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 18:08:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-07 18:08:21,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:21,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288454583] [2019-12-07 18:08:21,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:21,947 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 18:08:21,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288454583] [2019-12-07 18:08:21,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:21,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:21,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264980363] [2019-12-07 18:08:21,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:08:21,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:21,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:08:21,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:21,949 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-07 18:08:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,366 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-07 18:08:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:08:22,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 18:08:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,395 INFO L225 Difference]: With dead ends: 26038 [2019-12-07 18:08:22,395 INFO L226 Difference]: Without dead ends: 26038 [2019-12-07 18:08:22,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:08:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-07 18:08:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-07 18:08:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-07 18:08:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-07 18:08:22,721 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-07 18:08:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,722 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-07 18:08:22,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:08:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-07 18:08:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:08:22,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,741 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 18:08:22,741 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 18:08:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-07 18:08:22,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286444938] [2019-12-07 18:08:22,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,790 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 18:08:22,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286444938] [2019-12-07 18:08:22,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:22,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100618062] [2019-12-07 18:08:22,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:08:22,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:08:22,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:22,792 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-07 18:08:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,497 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-07 18:08:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:08:23,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 18:08:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,528 INFO L225 Difference]: With dead ends: 28794 [2019-12-07 18:08:23,528 INFO L226 Difference]: Without dead ends: 28794 [2019-12-07 18:08:23,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:08:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-07 18:08:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-07 18:08:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-07 18:08:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-07 18:08:24,209 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-07 18:08:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:24,209 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-07 18:08:24,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:08:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-07 18:08:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:24,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:24,229 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] [2019-12-07 18:08:24,229 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 18:08:24,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:24,229 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-07 18:08:24,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:24,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742355980] [2019-12-07 18:08:24,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:24,258 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 18:08:24,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742355980] [2019-12-07 18:08:24,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:24,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:24,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912996614] [2019-12-07 18:08:24,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:24,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:24,259 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 3 states. [2019-12-07 18:08:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:24,314 INFO L93 Difference]: Finished difference Result 18490 states and 54902 transitions. [2019-12-07 18:08:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:24,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:24,335 INFO L225 Difference]: With dead ends: 18490 [2019-12-07 18:08:24,335 INFO L226 Difference]: Without dead ends: 18490 [2019-12-07 18:08:24,336 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 18:08:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18490 states. [2019-12-07 18:08:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18490 to 18482. [2019-12-07 18:08:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18482 states. [2019-12-07 18:08:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18482 states to 18482 states and 54886 transitions. [2019-12-07 18:08:24,600 INFO L78 Accepts]: Start accepts. Automaton has 18482 states and 54886 transitions. Word has length 39 [2019-12-07 18:08:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:24,600 INFO L462 AbstractCegarLoop]: Abstraction has 18482 states and 54886 transitions. [2019-12-07 18:08:24,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 18482 states and 54886 transitions. [2019-12-07 18:08:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:08:24,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:24,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:24,616 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 18:08:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash -385256315, now seen corresponding path program 1 times [2019-12-07 18:08:24,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:24,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820866512] [2019-12-07 18:08:24,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:24,662 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 18:08:24,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820866512] [2019-12-07 18:08:24,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:24,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:24,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018584172] [2019-12-07 18:08:24,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:24,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:24,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:24,663 INFO L87 Difference]: Start difference. First operand 18482 states and 54886 transitions. Second operand 5 states. [2019-12-07 18:08:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:25,030 INFO L93 Difference]: Finished difference Result 26278 states and 77548 transitions. [2019-12-07 18:08:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:08:25,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 18:08:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:25,058 INFO L225 Difference]: With dead ends: 26278 [2019-12-07 18:08:25,058 INFO L226 Difference]: Without dead ends: 26278 [2019-12-07 18:08:25,059 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 18:08:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26278 states. [2019-12-07 18:08:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26278 to 24232. [2019-12-07 18:08:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24232 states. [2019-12-07 18:08:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24232 states to 24232 states and 71972 transitions. [2019-12-07 18:08:25,395 INFO L78 Accepts]: Start accepts. Automaton has 24232 states and 71972 transitions. Word has length 40 [2019-12-07 18:08:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:25,396 INFO L462 AbstractCegarLoop]: Abstraction has 24232 states and 71972 transitions. [2019-12-07 18:08:25,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24232 states and 71972 transitions. [2019-12-07 18:08:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:08:25,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:25,415 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 18:08:25,415 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 18:08:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1759080769, now seen corresponding path program 2 times [2019-12-07 18:08:25,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:25,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252921250] [2019-12-07 18:08:25,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:25,457 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 18:08:25,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252921250] [2019-12-07 18:08:25,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:25,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:25,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189946877] [2019-12-07 18:08:25,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:25,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:25,458 INFO L87 Difference]: Start difference. First operand 24232 states and 71972 transitions. Second operand 5 states. [2019-12-07 18:08:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:25,737 INFO L93 Difference]: Finished difference Result 32357 states and 94957 transitions. [2019-12-07 18:08:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:08:25,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 18:08:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:25,772 INFO L225 Difference]: With dead ends: 32357 [2019-12-07 18:08:25,772 INFO L226 Difference]: Without dead ends: 32357 [2019-12-07 18:08:25,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32357 states. [2019-12-07 18:08:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32357 to 26006. [2019-12-07 18:08:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26006 states. [2019-12-07 18:08:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26006 states to 26006 states and 77298 transitions. [2019-12-07 18:08:26,179 INFO L78 Accepts]: Start accepts. Automaton has 26006 states and 77298 transitions. Word has length 40 [2019-12-07 18:08:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:26,180 INFO L462 AbstractCegarLoop]: Abstraction has 26006 states and 77298 transitions. [2019-12-07 18:08:26,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26006 states and 77298 transitions. [2019-12-07 18:08:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:08:26,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:26,201 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 18:08:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash -805249787, now seen corresponding path program 3 times [2019-12-07 18:08:26,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:26,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193160501] [2019-12-07 18:08:26,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:26,233 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 18:08:26,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193160501] [2019-12-07 18:08:26,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:26,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:26,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910325257] [2019-12-07 18:08:26,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:26,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:26,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:26,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:26,234 INFO L87 Difference]: Start difference. First operand 26006 states and 77298 transitions. Second operand 3 states. [2019-12-07 18:08:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:26,302 INFO L93 Difference]: Finished difference Result 25920 states and 77035 transitions. [2019-12-07 18:08:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:26,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 18:08:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:26,333 INFO L225 Difference]: With dead ends: 25920 [2019-12-07 18:08:26,333 INFO L226 Difference]: Without dead ends: 25920 [2019-12-07 18:08:26,334 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 18:08:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25920 states. [2019-12-07 18:08:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25920 to 21247. [2019-12-07 18:08:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21247 states. [2019-12-07 18:08:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21247 states to 21247 states and 64010 transitions. [2019-12-07 18:08:26,747 INFO L78 Accepts]: Start accepts. Automaton has 21247 states and 64010 transitions. Word has length 40 [2019-12-07 18:08:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:26,747 INFO L462 AbstractCegarLoop]: Abstraction has 21247 states and 64010 transitions. [2019-12-07 18:08:26,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 21247 states and 64010 transitions. [2019-12-07 18:08:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:08:26,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:26,763 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 18:08:26,763 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 18:08:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1843753540, now seen corresponding path program 1 times [2019-12-07 18:08:26,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:26,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647402595] [2019-12-07 18:08:26,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647402595] [2019-12-07 18:08:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:26,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413242103] [2019-12-07 18:08:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:26,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:26,812 INFO L87 Difference]: Start difference. First operand 21247 states and 64010 transitions. Second operand 5 states. [2019-12-07 18:08:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:26,872 INFO L93 Difference]: Finished difference Result 19981 states and 61225 transitions. [2019-12-07 18:08:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:08:26,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 18:08:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:26,893 INFO L225 Difference]: With dead ends: 19981 [2019-12-07 18:08:26,893 INFO L226 Difference]: Without dead ends: 19981 [2019-12-07 18:08:26,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19981 states. [2019-12-07 18:08:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19981 to 19981. [2019-12-07 18:08:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19981 states. [2019-12-07 18:08:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19981 states to 19981 states and 61225 transitions. [2019-12-07 18:08:27,165 INFO L78 Accepts]: Start accepts. Automaton has 19981 states and 61225 transitions. Word has length 41 [2019-12-07 18:08:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:27,165 INFO L462 AbstractCegarLoop]: Abstraction has 19981 states and 61225 transitions. [2019-12-07 18:08:27,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19981 states and 61225 transitions. [2019-12-07 18:08:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:08:27,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:27,181 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 18:08:27,182 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 18:08:27,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:27,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1628177899, now seen corresponding path program 1 times [2019-12-07 18:08:27,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:27,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749448202] [2019-12-07 18:08:27,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:27,212 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 18:08:27,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749448202] [2019-12-07 18:08:27,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:27,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:27,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016477370] [2019-12-07 18:08:27,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:27,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:27,213 INFO L87 Difference]: Start difference. First operand 19981 states and 61225 transitions. Second operand 3 states. [2019-12-07 18:08:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:27,306 INFO L93 Difference]: Finished difference Result 24508 states and 73719 transitions. [2019-12-07 18:08:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:27,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:08:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:27,333 INFO L225 Difference]: With dead ends: 24508 [2019-12-07 18:08:27,333 INFO L226 Difference]: Without dead ends: 24508 [2019-12-07 18:08:27,333 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 18:08:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24508 states. [2019-12-07 18:08:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24508 to 19200. [2019-12-07 18:08:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19200 states. [2019-12-07 18:08:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19200 states to 19200 states and 57869 transitions. [2019-12-07 18:08:27,654 INFO L78 Accepts]: Start accepts. Automaton has 19200 states and 57869 transitions. Word has length 66 [2019-12-07 18:08:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 19200 states and 57869 transitions. [2019-12-07 18:08:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 19200 states and 57869 transitions. [2019-12-07 18:08:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:08:27,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:27,670 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 18:08:27,670 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 18:08:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:27,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702190, now seen corresponding path program 1 times [2019-12-07 18:08:27,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:27,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656831589] [2019-12-07 18:08:27,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:27,717 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 18:08:27,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656831589] [2019-12-07 18:08:27,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:27,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:27,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795939397] [2019-12-07 18:08:27,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:27,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:27,718 INFO L87 Difference]: Start difference. First operand 19200 states and 57869 transitions. Second operand 3 states. [2019-12-07 18:08:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:27,808 INFO L93 Difference]: Finished difference Result 22495 states and 67998 transitions. [2019-12-07 18:08:27,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:27,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:08:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:27,831 INFO L225 Difference]: With dead ends: 22495 [2019-12-07 18:08:27,831 INFO L226 Difference]: Without dead ends: 22495 [2019-12-07 18:08:27,832 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 18:08:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2019-12-07 18:08:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 17394. [2019-12-07 18:08:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17394 states. [2019-12-07 18:08:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17394 states to 17394 states and 52850 transitions. [2019-12-07 18:08:28,114 INFO L78 Accepts]: Start accepts. Automaton has 17394 states and 52850 transitions. Word has length 66 [2019-12-07 18:08:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:28,115 INFO L462 AbstractCegarLoop]: Abstraction has 17394 states and 52850 transitions. [2019-12-07 18:08:28,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17394 states and 52850 transitions. [2019-12-07 18:08:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:28,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:28,128 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 18:08:28,129 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 18:08:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1992119349, now seen corresponding path program 1 times [2019-12-07 18:08:28,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:28,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204063185] [2019-12-07 18:08:28,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:28,168 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 18:08:28,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204063185] [2019-12-07 18:08:28,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:28,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:28,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108046224] [2019-12-07 18:08:28,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:28,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:28,169 INFO L87 Difference]: Start difference. First operand 17394 states and 52850 transitions. Second operand 4 states. [2019-12-07 18:08:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:28,252 INFO L93 Difference]: Finished difference Result 17209 states and 52078 transitions. [2019-12-07 18:08:28,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:28,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:08:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:28,271 INFO L225 Difference]: With dead ends: 17209 [2019-12-07 18:08:28,271 INFO L226 Difference]: Without dead ends: 17209 [2019-12-07 18:08:28,271 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 18:08:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17209 states. [2019-12-07 18:08:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17209 to 14887. [2019-12-07 18:08:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14887 states. [2019-12-07 18:08:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 44963 transitions. [2019-12-07 18:08:28,501 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 44963 transitions. Word has length 67 [2019-12-07 18:08:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:28,501 INFO L462 AbstractCegarLoop]: Abstraction has 14887 states and 44963 transitions. [2019-12-07 18:08:28,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 44963 transitions. [2019-12-07 18:08:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:28,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:28,514 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 18:08:28,514 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 18:08:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1668578459, now seen corresponding path program 1 times [2019-12-07 18:08:28,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:28,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099981536] [2019-12-07 18:08:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:28,742 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 18:08:28,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099981536] [2019-12-07 18:08:28,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:28,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:08:28,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809496994] [2019-12-07 18:08:28,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:08:28,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:08:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:08:28,744 INFO L87 Difference]: Start difference. First operand 14887 states and 44963 transitions. Second operand 10 states. [2019-12-07 18:08:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:29,667 INFO L93 Difference]: Finished difference Result 48580 states and 146731 transitions. [2019-12-07 18:08:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:08:29,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 18:08:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:29,716 INFO L225 Difference]: With dead ends: 48580 [2019-12-07 18:08:29,716 INFO L226 Difference]: Without dead ends: 44658 [2019-12-07 18:08:29,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:08:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44658 states. [2019-12-07 18:08:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44658 to 17913. [2019-12-07 18:08:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17913 states. [2019-12-07 18:08:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17913 states to 17913 states and 53833 transitions. [2019-12-07 18:08:30,143 INFO L78 Accepts]: Start accepts. Automaton has 17913 states and 53833 transitions. Word has length 67 [2019-12-07 18:08:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:30,143 INFO L462 AbstractCegarLoop]: Abstraction has 17913 states and 53833 transitions. [2019-12-07 18:08:30,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:08:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17913 states and 53833 transitions. [2019-12-07 18:08:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:30,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:30,158 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 18:08:30,158 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 18:08:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:30,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1956141025, now seen corresponding path program 2 times [2019-12-07 18:08:30,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:30,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165084791] [2019-12-07 18:08:30,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:30,226 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 18:08:30,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165084791] [2019-12-07 18:08:30,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:30,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:30,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090392174] [2019-12-07 18:08:30,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:30,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:30,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:30,227 INFO L87 Difference]: Start difference. First operand 17913 states and 53833 transitions. Second operand 4 states. [2019-12-07 18:08:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:30,319 INFO L93 Difference]: Finished difference Result 29475 states and 88828 transitions. [2019-12-07 18:08:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:08:30,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:08:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:30,349 INFO L225 Difference]: With dead ends: 29475 [2019-12-07 18:08:30,349 INFO L226 Difference]: Without dead ends: 26258 [2019-12-07 18:08:30,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:08:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26258 states. [2019-12-07 18:08:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26258 to 16600. [2019-12-07 18:08:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16600 states. [2019-12-07 18:08:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16600 states to 16600 states and 50087 transitions. [2019-12-07 18:08:30,636 INFO L78 Accepts]: Start accepts. Automaton has 16600 states and 50087 transitions. Word has length 67 [2019-12-07 18:08:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:30,637 INFO L462 AbstractCegarLoop]: Abstraction has 16600 states and 50087 transitions. [2019-12-07 18:08:30,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16600 states and 50087 transitions. [2019-12-07 18:08:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:30,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:30,650 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 18:08:30,650 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 18:08:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1376638825, now seen corresponding path program 3 times [2019-12-07 18:08:30,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:30,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474467042] [2019-12-07 18:08:30,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:30,694 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 18:08:30,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474467042] [2019-12-07 18:08:30,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:30,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:30,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113475065] [2019-12-07 18:08:30,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:30,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:30,695 INFO L87 Difference]: Start difference. First operand 16600 states and 50087 transitions. Second operand 4 states. [2019-12-07 18:08:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:30,779 INFO L93 Difference]: Finished difference Result 26532 states and 80293 transitions. [2019-12-07 18:08:30,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:30,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:08:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:30,790 INFO L225 Difference]: With dead ends: 26532 [2019-12-07 18:08:30,790 INFO L226 Difference]: Without dead ends: 10920 [2019-12-07 18:08:30,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:08:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2019-12-07 18:08:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2019-12-07 18:08:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-12-07 18:08:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33116 transitions. [2019-12-07 18:08:30,952 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33116 transitions. Word has length 67 [2019-12-07 18:08:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:30,952 INFO L462 AbstractCegarLoop]: Abstraction has 10920 states and 33116 transitions. [2019-12-07 18:08:30,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33116 transitions. [2019-12-07 18:08:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:30,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:30,961 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 18:08:30,961 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 18:08:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:30,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1541701607, now seen corresponding path program 4 times [2019-12-07 18:08:30,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:30,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551073940] [2019-12-07 18:08:30,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:31,030 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 18:08:31,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551073940] [2019-12-07 18:08:31,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:31,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:31,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899048988] [2019-12-07 18:08:31,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:31,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:31,031 INFO L87 Difference]: Start difference. First operand 10920 states and 33116 transitions. Second operand 4 states. [2019-12-07 18:08:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:31,095 INFO L93 Difference]: Finished difference Result 19426 states and 59182 transitions. [2019-12-07 18:08:31,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:08:31,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:08:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:31,112 INFO L225 Difference]: With dead ends: 19426 [2019-12-07 18:08:31,112 INFO L226 Difference]: Without dead ends: 16986 [2019-12-07 18:08:31,113 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 18:08:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16986 states. [2019-12-07 18:08:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16986 to 10689. [2019-12-07 18:08:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10689 states. [2019-12-07 18:08:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10689 states to 10689 states and 32428 transitions. [2019-12-07 18:08:31,310 INFO L78 Accepts]: Start accepts. Automaton has 10689 states and 32428 transitions. Word has length 67 [2019-12-07 18:08:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:31,311 INFO L462 AbstractCegarLoop]: Abstraction has 10689 states and 32428 transitions. [2019-12-07 18:08:31,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 10689 states and 32428 transitions. [2019-12-07 18:08:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:31,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:31,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:31,320 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 18:08:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1209323901, now seen corresponding path program 5 times [2019-12-07 18:08:31,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:31,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285116383] [2019-12-07 18:08:31,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:31,389 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 18:08:31,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285116383] [2019-12-07 18:08:31,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:31,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:31,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6522325] [2019-12-07 18:08:31,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:31,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:31,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:31,390 INFO L87 Difference]: Start difference. First operand 10689 states and 32428 transitions. Second operand 5 states. [2019-12-07 18:08:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:31,448 INFO L93 Difference]: Finished difference Result 19013 states and 57957 transitions. [2019-12-07 18:08:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:08:31,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 18:08:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:31,457 INFO L225 Difference]: With dead ends: 19013 [2019-12-07 18:08:31,457 INFO L226 Difference]: Without dead ends: 9178 [2019-12-07 18:08:31,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:08:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2019-12-07 18:08:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 9178. [2019-12-07 18:08:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9178 states. [2019-12-07 18:08:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 27909 transitions. [2019-12-07 18:08:31,624 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 27909 transitions. Word has length 67 [2019-12-07 18:08:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:31,624 INFO L462 AbstractCegarLoop]: Abstraction has 9178 states and 27909 transitions. [2019-12-07 18:08:31,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 27909 transitions. [2019-12-07 18:08:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:31,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:31,631 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 18:08:31,631 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 18:08:31,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 6 times [2019-12-07 18:08:31,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:31,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87313030] [2019-12-07 18:08:31,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:31,745 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 18:08:31,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87313030] [2019-12-07 18:08:31,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:31,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:08:31,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624238180] [2019-12-07 18:08:31,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:08:31,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:31,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:08:31,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:08:31,747 INFO L87 Difference]: Start difference. First operand 9178 states and 27909 transitions. Second operand 11 states. [2019-12-07 18:08:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:32,357 INFO L93 Difference]: Finished difference Result 18815 states and 55749 transitions. [2019-12-07 18:08:32,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:08:32,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 18:08:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:32,369 INFO L225 Difference]: With dead ends: 18815 [2019-12-07 18:08:32,370 INFO L226 Difference]: Without dead ends: 12436 [2019-12-07 18:08:32,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:08:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12436 states. [2019-12-07 18:08:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12436 to 10345. [2019-12-07 18:08:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10345 states. [2019-12-07 18:08:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 30750 transitions. [2019-12-07 18:08:32,536 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 30750 transitions. Word has length 67 [2019-12-07 18:08:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:32,536 INFO L462 AbstractCegarLoop]: Abstraction has 10345 states and 30750 transitions. [2019-12-07 18:08:32,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:08:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 30750 transitions. [2019-12-07 18:08:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:08:32,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:32,544 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 18:08:32,544 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 7 times [2019-12-07 18:08:32,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:32,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799723222] [2019-12-07 18:08:32,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:32,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:08:32,640 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:08:32,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25| 1)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_25| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25|) 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 18:08:32,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-07 18:08:32,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 18:08:32,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff0_thd1~0_In-1339576252 ~b$r_buff1_thd1~0_Out-1339576252) (= ~b$r_buff0_thd3~0_In-1339576252 ~b$r_buff1_thd3~0_Out-1339576252) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252 0)) (= ~x~0_In-1339576252 ~__unbuffered_p0_EAX~0_Out-1339576252) (= ~b$r_buff0_thd0~0_In-1339576252 ~b$r_buff1_thd0~0_Out-1339576252) (= ~b$r_buff0_thd2~0_In-1339576252 ~b$r_buff1_thd2~0_Out-1339576252) (= 1 ~b$r_buff0_thd1~0_Out-1339576252)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1339576252, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1339576252, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1339576252, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252, ~x~0=~x~0_In-1339576252, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1339576252} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1339576252, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1339576252, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1339576252, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1339576252, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1339576252, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1339576252, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1339576252, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1339576252, ~x~0=~x~0_In-1339576252, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1339576252} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 18:08:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd2~0_In1740454497 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1740454497 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1740454497| ~b$w_buff1~0_In1740454497)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1740454497| ~b~0_In1740454497)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1740454497, ~b~0=~b~0_In1740454497, ~b$w_buff1~0=~b$w_buff1~0_In1740454497, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1740454497} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1740454497, ~b~0=~b~0_In1740454497, ~b$w_buff1~0=~b$w_buff1~0_In1740454497, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1740454497|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1740454497} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:08:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:08:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-2128902244 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-2128902244 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-2128902244| ~b$w_buff0_used~0_In-2128902244) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-2128902244| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-2128902244|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 18:08:32,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-181136607 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-181136607 256) 0)) (.cse3 (= (mod ~b$w_buff0_used~0_In-181136607 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd2~0_In-181136607 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out-181136607| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~b$w_buff1_used~0_In-181136607 |P1Thread1of1ForFork0_#t~ite12_Out-181136607|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-181136607, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-181136607, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-181136607, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-181136607} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-181136607, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-181136607, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-181136607, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-181136607|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-181136607} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:08:32,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-987323291 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-987323291 256)))) (or (and (= ~b$r_buff0_thd2~0_In-987323291 |P1Thread1of1ForFork0_#t~ite13_Out-987323291|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-987323291| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-987323291, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-987323291} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-987323291, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-987323291, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-987323291|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 18:08:32,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In233556834 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In233556834 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In233556834 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In233556834 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out233556834|)) (and (= ~b$r_buff1_thd2~0_In233556834 |P1Thread1of1ForFork0_#t~ite14_Out233556834|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In233556834, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In233556834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In233556834, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In233556834} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In233556834, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In233556834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In233556834, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out233556834|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In233556834} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 18:08:32,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:08:32,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-94073127 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_Out-94073127| ~b$w_buff0~0_In-94073127) (= |P2Thread1of1ForFork1_#t~ite21_Out-94073127| |P2Thread1of1ForFork1_#t~ite20_Out-94073127|) (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In-94073127 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In-94073127 256) 0) .cse0) (= 0 (mod ~b$w_buff0_used~0_In-94073127 256)) (and (= (mod ~b$r_buff1_thd3~0_In-94073127 256) 0) .cse0))) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite21_Out-94073127| ~b$w_buff0~0_In-94073127) (= |P2Thread1of1ForFork1_#t~ite20_In-94073127| |P2Thread1of1ForFork1_#t~ite20_Out-94073127|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-94073127, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-94073127, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-94073127|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-94073127, ~b$w_buff0~0=~b$w_buff0~0_In-94073127, ~weak$$choice2~0=~weak$$choice2~0_In-94073127, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-94073127} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-94073127, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-94073127, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-94073127|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-94073127|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-94073127, ~b$w_buff0~0=~b$w_buff0~0_In-94073127, ~weak$$choice2~0=~weak$$choice2~0_In-94073127, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-94073127} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:08:32,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1025202143 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In1025202143| |P2Thread1of1ForFork1_#t~ite26_Out1025202143|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out1025202143| ~b$w_buff0_used~0_In1025202143)) (and (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1025202143 256)))) (or (and (= 0 (mod ~b$w_buff1_used~0_In1025202143 256)) .cse1) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In1025202143 256))) (= 0 (mod ~b$w_buff0_used~0_In1025202143 256)))) (= |P2Thread1of1ForFork1_#t~ite26_Out1025202143| ~b$w_buff0_used~0_In1025202143) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out1025202143| |P2Thread1of1ForFork1_#t~ite27_Out1025202143|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1025202143, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1025202143, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In1025202143|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1025202143, ~weak$$choice2~0=~weak$$choice2~0_In1025202143, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1025202143} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1025202143, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out1025202143|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1025202143, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out1025202143|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1025202143, ~weak$$choice2~0=~weak$$choice2~0_In1025202143, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1025202143} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 18:08:32,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:08:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 18:08:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In2098222730 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd3~0_In2098222730 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out2098222730| ~b~0_In2098222730)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out2098222730| ~b$w_buff1~0_In2098222730)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In2098222730, ~b~0=~b~0_In2098222730, ~b$w_buff1~0=~b$w_buff1~0_In2098222730, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2098222730} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out2098222730|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2098222730, ~b~0=~b~0_In2098222730, ~b$w_buff1~0=~b$w_buff1~0_In2098222730, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2098222730} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 18:08:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 18:08:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-725845716 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-725845716 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out-725845716| 0)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-725845716 |P2Thread1of1ForFork1_#t~ite40_Out-725845716|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-725845716} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-725845716, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-725845716|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 18:08:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In114749455 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In114749455 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In114749455 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In114749455 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out114749455| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite41_Out114749455| ~b$w_buff1_used~0_In114749455) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In114749455} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out114749455|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In114749455} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 18:08:32,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1189180660 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1189180660 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out1189180660| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out1189180660| ~b$r_buff0_thd3~0_In1189180660)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1189180660} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1189180660, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1189180660|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 18:08:32,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1967251826 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In1967251826 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In1967251826 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1967251826 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out1967251826| ~b$r_buff1_thd3~0_In1967251826) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out1967251826| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1967251826} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1967251826, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1967251826|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1967251826} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 18:08:32,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:08:32,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In976816567 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In976816567 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out976816567| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out976816567| ~b$w_buff0_used~0_In976816567)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In976816567, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In976816567} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In976816567, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In976816567, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out976816567|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 18:08:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-1303366422 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-1303366422 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-1303366422 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1303366422 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1303366422| ~b$w_buff1_used~0_In-1303366422) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite6_Out-1303366422| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1303366422, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1303366422, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1303366422} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1303366422, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1303366422, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1303366422, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1303366422|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 18:08:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-451554226 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd1~0_In-451554226 256) 0)) (.cse1 (= ~b$r_buff0_thd1~0_In-451554226 ~b$r_buff0_thd1~0_Out-451554226))) (or (and .cse0 .cse1) (and (not .cse2) (= ~b$r_buff0_thd1~0_Out-451554226 0) (not .cse0)) (and .cse2 .cse1))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-451554226, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-451554226} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-451554226, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-451554226, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-451554226|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 18:08:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~b$w_buff0_used~0_In1442892500 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd1~0_In1442892500 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1442892500 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1442892500 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out1442892500| ~b$r_buff1_thd1~0_In1442892500) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out1442892500|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1442892500, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1442892500, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1442892500, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1442892500, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1442892500, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1442892500, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1442892500|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 18:08:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:08:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:08:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-538300858 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-538300858 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-538300858 |ULTIMATE.start_main_#t~ite47_Out-538300858|)) (and (= ~b~0_In-538300858 |ULTIMATE.start_main_#t~ite47_Out-538300858|) (or .cse0 .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-538300858, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-538300858, ~b~0=~b~0_In-538300858, ~b$w_buff1~0=~b$w_buff1~0_In-538300858} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-538300858, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-538300858, ~b~0=~b~0_In-538300858, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-538300858|, ~b$w_buff1~0=~b$w_buff1~0_In-538300858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 18:08:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:08:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-6436047 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-6436047 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-6436047|)) (and (= ~b$w_buff0_used~0_In-6436047 |ULTIMATE.start_main_#t~ite49_Out-6436047|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-6436047} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-6436047|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-6436047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:08:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1687707866 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1687707866 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In-1687707866 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-1687707866 256) 0))) (or (and (= ~b$w_buff1_used~0_In-1687707866 |ULTIMATE.start_main_#t~ite50_Out-1687707866|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1687707866|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1687707866, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1687707866, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1687707866, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1687707866} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1687707866|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1687707866, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1687707866, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1687707866, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1687707866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:08:32,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In-977118759 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-977118759 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-977118759| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-977118759| ~b$r_buff0_thd0~0_In-977118759)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-977118759} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-977118759|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-977118759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:08:32,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In-854439071 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-854439071 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-854439071 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-854439071 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-854439071| 0)) (and (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In-854439071 |ULTIMATE.start_main_#t~ite52_Out-854439071|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-854439071, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-854439071, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-854439071, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-854439071} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-854439071, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-854439071|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-854439071, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-854439071, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-854439071} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:08:32,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, 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, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:08:32,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:08:32 BasicIcfg [2019-12-07 18:08:32,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:08:32,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:08:32,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:08:32,717 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:08:32,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:00" (3/4) ... [2019-12-07 18:08:32,719 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:08:32,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25| 1)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_25| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25|) 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 18:08:32,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-07 18:08:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 18:08:32,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff0_thd1~0_In-1339576252 ~b$r_buff1_thd1~0_Out-1339576252) (= ~b$r_buff0_thd3~0_In-1339576252 ~b$r_buff1_thd3~0_Out-1339576252) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252 0)) (= ~x~0_In-1339576252 ~__unbuffered_p0_EAX~0_Out-1339576252) (= ~b$r_buff0_thd0~0_In-1339576252 ~b$r_buff1_thd0~0_Out-1339576252) (= ~b$r_buff0_thd2~0_In-1339576252 ~b$r_buff1_thd2~0_Out-1339576252) (= 1 ~b$r_buff0_thd1~0_Out-1339576252)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1339576252, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1339576252, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1339576252, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252, ~x~0=~x~0_In-1339576252, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1339576252} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1339576252, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1339576252, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1339576252, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1339576252, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1339576252, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1339576252, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1339576252, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1339576252, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1339576252, ~x~0=~x~0_In-1339576252, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1339576252} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 18:08:32,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd2~0_In1740454497 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1740454497 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1740454497| ~b$w_buff1~0_In1740454497)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1740454497| ~b~0_In1740454497)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1740454497, ~b~0=~b~0_In1740454497, ~b$w_buff1~0=~b$w_buff1~0_In1740454497, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1740454497} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1740454497, ~b~0=~b~0_In1740454497, ~b$w_buff1~0=~b$w_buff1~0_In1740454497, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1740454497|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1740454497} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:08:32,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 18:08:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-2128902244 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-2128902244 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-2128902244| ~b$w_buff0_used~0_In-2128902244) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out-2128902244| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2128902244, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2128902244, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-2128902244|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 18:08:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-181136607 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In-181136607 256) 0)) (.cse3 (= (mod ~b$w_buff0_used~0_In-181136607 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd2~0_In-181136607 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite12_Out-181136607| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~b$w_buff1_used~0_In-181136607 |P1Thread1of1ForFork0_#t~ite12_Out-181136607|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-181136607, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-181136607, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-181136607, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-181136607} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-181136607, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-181136607, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-181136607, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-181136607|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-181136607} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:08:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-987323291 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-987323291 256)))) (or (and (= ~b$r_buff0_thd2~0_In-987323291 |P1Thread1of1ForFork0_#t~ite13_Out-987323291|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite13_Out-987323291| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-987323291, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-987323291} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-987323291, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-987323291, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-987323291|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 18:08:32,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In233556834 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In233556834 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In233556834 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In233556834 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite14_Out233556834|)) (and (= ~b$r_buff1_thd2~0_In233556834 |P1Thread1of1ForFork0_#t~ite14_Out233556834|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In233556834, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In233556834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In233556834, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In233556834} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In233556834, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In233556834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In233556834, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out233556834|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In233556834} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 18:08:32,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:08:32,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-94073127 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_Out-94073127| ~b$w_buff0~0_In-94073127) (= |P2Thread1of1ForFork1_#t~ite21_Out-94073127| |P2Thread1of1ForFork1_#t~ite20_Out-94073127|) (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In-94073127 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In-94073127 256) 0) .cse0) (= 0 (mod ~b$w_buff0_used~0_In-94073127 256)) (and (= (mod ~b$r_buff1_thd3~0_In-94073127 256) 0) .cse0))) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite21_Out-94073127| ~b$w_buff0~0_In-94073127) (= |P2Thread1of1ForFork1_#t~ite20_In-94073127| |P2Thread1of1ForFork1_#t~ite20_Out-94073127|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-94073127, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-94073127, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-94073127|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-94073127, ~b$w_buff0~0=~b$w_buff0~0_In-94073127, ~weak$$choice2~0=~weak$$choice2~0_In-94073127, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-94073127} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-94073127, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-94073127, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-94073127|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-94073127|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-94073127, ~b$w_buff0~0=~b$w_buff0~0_In-94073127, ~weak$$choice2~0=~weak$$choice2~0_In-94073127, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-94073127} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:08:32,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1025202143 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_In1025202143| |P2Thread1of1ForFork1_#t~ite26_Out1025202143|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out1025202143| ~b$w_buff0_used~0_In1025202143)) (and (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1025202143 256)))) (or (and (= 0 (mod ~b$w_buff1_used~0_In1025202143 256)) .cse1) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In1025202143 256))) (= 0 (mod ~b$w_buff0_used~0_In1025202143 256)))) (= |P2Thread1of1ForFork1_#t~ite26_Out1025202143| ~b$w_buff0_used~0_In1025202143) .cse0 (= |P2Thread1of1ForFork1_#t~ite26_Out1025202143| |P2Thread1of1ForFork1_#t~ite27_Out1025202143|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1025202143, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1025202143, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In1025202143|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1025202143, ~weak$$choice2~0=~weak$$choice2~0_In1025202143, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1025202143} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1025202143, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out1025202143|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1025202143, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out1025202143|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1025202143, ~weak$$choice2~0=~weak$$choice2~0_In1025202143, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1025202143} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 18:08:32,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:08:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 18:08:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In2098222730 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd3~0_In2098222730 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out2098222730| ~b~0_In2098222730)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out2098222730| ~b$w_buff1~0_In2098222730)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In2098222730, ~b~0=~b~0_In2098222730, ~b$w_buff1~0=~b$w_buff1~0_In2098222730, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2098222730} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out2098222730|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2098222730, ~b~0=~b~0_In2098222730, ~b$w_buff1~0=~b$w_buff1~0_In2098222730, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2098222730} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 18:08:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 18:08:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-725845716 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-725845716 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite40_Out-725845716| 0)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-725845716 |P2Thread1of1ForFork1_#t~ite40_Out-725845716|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-725845716} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-725845716, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-725845716, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-725845716|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 18:08:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In114749455 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In114749455 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In114749455 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd3~0_In114749455 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out114749455| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite41_Out114749455| ~b$w_buff1_used~0_In114749455) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In114749455} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In114749455, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In114749455, ~b$w_buff1_used~0=~b$w_buff1_used~0_In114749455, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out114749455|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In114749455} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 18:08:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1189180660 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1189180660 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out1189180660| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out1189180660| ~b$r_buff0_thd3~0_In1189180660)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1189180660} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1189180660, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1189180660, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1189180660|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 18:08:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1967251826 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In1967251826 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In1967251826 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In1967251826 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out1967251826| ~b$r_buff1_thd3~0_In1967251826) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out1967251826| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1967251826, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1967251826} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1967251826, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1967251826, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1967251826|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1967251826, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1967251826} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 18:08:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:08:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In976816567 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In976816567 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite5_Out976816567| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite5_Out976816567| ~b$w_buff0_used~0_In976816567)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In976816567, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In976816567} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In976816567, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In976816567, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out976816567|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 18:08:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-1303366422 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-1303366422 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In-1303366422 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1303366422 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1303366422| ~b$w_buff1_used~0_In-1303366422) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork2_#t~ite6_Out-1303366422| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1303366422, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1303366422, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1303366422} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1303366422, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1303366422, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1303366422, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1303366422, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1303366422|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 18:08:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-451554226 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd1~0_In-451554226 256) 0)) (.cse1 (= ~b$r_buff0_thd1~0_In-451554226 ~b$r_buff0_thd1~0_Out-451554226))) (or (and .cse0 .cse1) (and (not .cse2) (= ~b$r_buff0_thd1~0_Out-451554226 0) (not .cse0)) (and .cse2 .cse1))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-451554226, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-451554226} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-451554226, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-451554226, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-451554226|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 18:08:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~b$w_buff0_used~0_In1442892500 256) 0)) (.cse2 (= (mod ~b$r_buff0_thd1~0_In1442892500 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1442892500 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In1442892500 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out1442892500| ~b$r_buff1_thd1~0_In1442892500) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out1442892500|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1442892500, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1442892500, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1442892500, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1442892500, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1442892500, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1442892500, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1442892500, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1442892500|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 18:08:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:08:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:08:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-538300858 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-538300858 256) 0))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-538300858 |ULTIMATE.start_main_#t~ite47_Out-538300858|)) (and (= ~b~0_In-538300858 |ULTIMATE.start_main_#t~ite47_Out-538300858|) (or .cse0 .cse1)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-538300858, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-538300858, ~b~0=~b~0_In-538300858, ~b$w_buff1~0=~b$w_buff1~0_In-538300858} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-538300858, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-538300858, ~b~0=~b~0_In-538300858, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-538300858|, ~b$w_buff1~0=~b$w_buff1~0_In-538300858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 18:08:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:08:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-6436047 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-6436047 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-6436047|)) (and (= ~b$w_buff0_used~0_In-6436047 |ULTIMATE.start_main_#t~ite49_Out-6436047|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-6436047} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-6436047, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-6436047|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-6436047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:08:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1687707866 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1687707866 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In-1687707866 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-1687707866 256) 0))) (or (and (= ~b$w_buff1_used~0_In-1687707866 |ULTIMATE.start_main_#t~ite50_Out-1687707866|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1687707866|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1687707866, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1687707866, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1687707866, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1687707866} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1687707866|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1687707866, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1687707866, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1687707866, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1687707866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:08:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In-977118759 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In-977118759 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-977118759| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-977118759| ~b$r_buff0_thd0~0_In-977118759)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-977118759} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-977118759, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-977118759|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-977118759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:08:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In-854439071 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-854439071 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-854439071 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-854439071 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-854439071| 0)) (and (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In-854439071 |ULTIMATE.start_main_#t~ite52_Out-854439071|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-854439071, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-854439071, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-854439071, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-854439071} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-854439071, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-854439071|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-854439071, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-854439071, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-854439071} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:08:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, 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, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:08:32,785 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cc7b6aee-1bbd-4227-92cf-693030708733/bin/uautomizer/witness.graphml [2019-12-07 18:08:32,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:08:32,786 INFO L168 Benchmark]: Toolchain (without parser) took 92972.49 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.7 GB). Free memory was 939.3 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:32,786 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:32,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:32,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:32,787 INFO L168 Benchmark]: Boogie Preprocessor took 26.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:32,787 INFO L168 Benchmark]: RCFGBuilder took 412.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:32,787 INFO L168 Benchmark]: TraceAbstraction took 92031.49 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 991.4 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 18:08:32,788 INFO L168 Benchmark]: Witness Printer took 68.56 ms. Allocated memory is still 7.7 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:32,789 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -114.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.4 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92031.49 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 991.4 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 68.56 ms. Allocated memory is still 7.7 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 91.8s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4306 SDtfs, 5311 SDslu, 8748 SDs, 0 SdLazy, 4683 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 38 SyntacticMatches, 17 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233994occurred 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: 55.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 209851 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1063 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 333370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...