./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/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 04cdd635864bb8fa2ce789c7c7aff153d47948e2 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:55:01,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:55:01,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:55:01,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:55:01,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:55:01,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:55:01,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:55:01,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:55:01,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:55:01,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:55:01,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:55:01,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:55:01,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:55:01,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:55:01,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:55:01,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:55:01,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:55:01,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:55:01,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:55:01,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:55:01,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:55:01,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:55:01,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:55:01,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:55:01,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:55:01,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:55:01,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:55:01,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:55:01,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:55:01,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:55:01,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:55:01,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:55:01,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:55:01,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:55:01,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:55:01,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:55:01,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:55:01,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:55:01,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:55:01,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:55:01,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:55:01,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:55:01,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:55:01,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:55:01,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:55:01,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:55:01,175 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:55:01,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:55:01,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:55:01,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:55:01,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:55:01,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:55:01,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:55:01,179 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_f3b60658-7da6-425e-bc63-36daf069751d/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 -> 04cdd635864bb8fa2ce789c7c7aff153d47948e2 [2019-12-07 10:55:01,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:55:01,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:55:01,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:55:01,290 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:55:01,290 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:55:01,291 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt.i [2019-12-07 10:55:01,334 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/data/a9a620184/3a378ef0f1ae4f9abec94eed28445fb8/FLAG916591eef [2019-12-07 10:55:01,710 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:55:01,711 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/sv-benchmarks/c/pthread-wmm/mix032_rmo.opt.i [2019-12-07 10:55:01,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/data/a9a620184/3a378ef0f1ae4f9abec94eed28445fb8/FLAG916591eef [2019-12-07 10:55:01,729 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/data/a9a620184/3a378ef0f1ae4f9abec94eed28445fb8 [2019-12-07 10:55:01,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:55:01,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:55:01,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:55:01,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:55:01,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:55:01,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:55:01" (1/1) ... [2019-12-07 10:55:01,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:01, skipping insertion in model container [2019-12-07 10:55:01,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:55:01" (1/1) ... [2019-12-07 10:55:01,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:55:01,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:55:02,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:55:02,034 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:55:02,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:55:02,119 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:55:02,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02 WrapperNode [2019-12-07 10:55:02,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:55:02,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:55:02,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:55:02,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:55:02,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:55:02,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:55:02,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:55:02,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:55:02,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... [2019-12-07 10:55:02,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:55:02,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:55:02,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:55:02,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:55:02,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/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 10:55:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:55:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:55:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:55:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:55:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:55:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:55:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:55:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:55:02,227 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 10:55:02,544 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:55:02,544 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:55:02,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:02 BoogieIcfgContainer [2019-12-07 10:55:02,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:55:02,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:55:02,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:55:02,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:55:02,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:55:01" (1/3) ... [2019-12-07 10:55:02,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840daee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:55:02, skipping insertion in model container [2019-12-07 10:55:02,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:55:02" (2/3) ... [2019-12-07 10:55:02,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840daee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:55:02, skipping insertion in model container [2019-12-07 10:55:02,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:02" (3/3) ... [2019-12-07 10:55:02,550 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.opt.i [2019-12-07 10:55:02,556 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:55:02,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:55:02,561 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:55:02,562 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:55:02,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,605 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:55:02,625 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:55:02,637 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:55:02,637 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:55:02,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:55:02,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:55:02,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:55:02,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:55:02,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:55:02,638 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:55:02,648 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-07 10:55:02,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 10:55:02,700 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 10:55:02,700 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:55:02,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 10:55:02,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 10:55:02,744 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 10:55:02,744 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:55:02,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 10:55:02,757 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 10:55:02,758 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:55:05,026 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 10:55:05,459 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 10:55:05,552 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-12-07 10:55:05,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 10:55:05,555 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 10:55:06,168 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-07 10:55:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-07 10:55:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:55:06,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:06,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:06,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-12-07 10:55:06,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:06,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332349580] [2019-12-07 10:55:06,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:06,333 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 10:55:06,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332349580] [2019-12-07 10:55:06,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:06,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:55:06,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195252571] [2019-12-07 10:55:06,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:06,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:06,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:06,348 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-07 10:55:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:06,570 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-07 10:55:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:06,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:55:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:06,675 INFO L225 Difference]: With dead ends: 14182 [2019-12-07 10:55:06,675 INFO L226 Difference]: Without dead ends: 13350 [2019-12-07 10:55:06,676 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 10:55:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-07 10:55:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-07 10:55:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-07 10:55:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-07 10:55:07,188 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-07 10:55:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:07,189 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-07 10:55:07,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-07 10:55:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:55:07,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:07,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:07,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-12-07 10:55:07,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:07,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842563618] [2019-12-07 10:55:07,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:07,276 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 10:55:07,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842563618] [2019-12-07 10:55:07,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:07,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:07,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662424530] [2019-12-07 10:55:07,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:07,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:07,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:07,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:07,279 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 4 states. [2019-12-07 10:55:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:07,573 INFO L93 Difference]: Finished difference Result 20194 states and 75632 transitions. [2019-12-07 10:55:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:55:07,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:55:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:07,666 INFO L225 Difference]: With dead ends: 20194 [2019-12-07 10:55:07,666 INFO L226 Difference]: Without dead ends: 20164 [2019-12-07 10:55:07,667 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 10:55:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-12-07 10:55:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18344. [2019-12-07 10:55:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-12-07 10:55:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 69695 transitions. [2019-12-07 10:55:08,176 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 69695 transitions. Word has length 13 [2019-12-07 10:55:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:08,176 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 69695 transitions. [2019-12-07 10:55:08,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 69695 transitions. [2019-12-07 10:55:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:55:08,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:08,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:08,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-12-07 10:55:08,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:08,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820512098] [2019-12-07 10:55:08,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:08,230 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 10:55:08,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820512098] [2019-12-07 10:55:08,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:08,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:08,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298381648] [2019-12-07 10:55:08,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:08,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:08,231 INFO L87 Difference]: Start difference. First operand 18344 states and 69695 transitions. Second operand 3 states. [2019-12-07 10:55:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:08,336 INFO L93 Difference]: Finished difference Result 23466 states and 87296 transitions. [2019-12-07 10:55:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:08,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:55:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:08,379 INFO L225 Difference]: With dead ends: 23466 [2019-12-07 10:55:08,379 INFO L226 Difference]: Without dead ends: 23466 [2019-12-07 10:55:08,379 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 10:55:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23466 states. [2019-12-07 10:55:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 20060. [2019-12-07 10:55:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20060 states. [2019-12-07 10:55:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 75793 transitions. [2019-12-07 10:55:08,816 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 75793 transitions. Word has length 16 [2019-12-07 10:55:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:08,816 INFO L462 AbstractCegarLoop]: Abstraction has 20060 states and 75793 transitions. [2019-12-07 10:55:08,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 75793 transitions. [2019-12-07 10:55:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:55:08,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:08,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:08,820 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-12-07 10:55:08,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:08,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71646398] [2019-12-07 10:55:08,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:08,858 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 10:55:08,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71646398] [2019-12-07 10:55:08,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:08,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:08,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886417564] [2019-12-07 10:55:08,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:08,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:08,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:08,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:08,859 INFO L87 Difference]: Start difference. First operand 20060 states and 75793 transitions. Second operand 4 states. [2019-12-07 10:55:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:09,017 INFO L93 Difference]: Finished difference Result 24056 states and 89213 transitions. [2019-12-07 10:55:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:55:09,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:55:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:09,075 INFO L225 Difference]: With dead ends: 24056 [2019-12-07 10:55:09,075 INFO L226 Difference]: Without dead ends: 24036 [2019-12-07 10:55:09,075 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 10:55:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2019-12-07 10:55:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21018. [2019-12-07 10:55:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21018 states. [2019-12-07 10:55:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 79114 transitions. [2019-12-07 10:55:09,561 INFO L78 Accepts]: Start accepts. Automaton has 21018 states and 79114 transitions. Word has length 16 [2019-12-07 10:55:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 21018 states and 79114 transitions. [2019-12-07 10:55:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 21018 states and 79114 transitions. [2019-12-07 10:55:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:55:09,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:09,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:09,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-12-07 10:55:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:09,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787914986] [2019-12-07 10:55:09,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:09,600 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 10:55:09,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787914986] [2019-12-07 10:55:09,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:09,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:09,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839164778] [2019-12-07 10:55:09,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:09,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:09,601 INFO L87 Difference]: Start difference. First operand 21018 states and 79114 transitions. Second operand 4 states. [2019-12-07 10:55:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:09,788 INFO L93 Difference]: Finished difference Result 26444 states and 98339 transitions. [2019-12-07 10:55:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:55:09,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:55:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:09,854 INFO L225 Difference]: With dead ends: 26444 [2019-12-07 10:55:09,854 INFO L226 Difference]: Without dead ends: 26414 [2019-12-07 10:55:09,854 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 10:55:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26414 states. [2019-12-07 10:55:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26414 to 21928. [2019-12-07 10:55:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21928 states. [2019-12-07 10:55:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 82711 transitions. [2019-12-07 10:55:10,351 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 82711 transitions. Word has length 16 [2019-12-07 10:55:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:10,351 INFO L462 AbstractCegarLoop]: Abstraction has 21928 states and 82711 transitions. [2019-12-07 10:55:10,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 82711 transitions. [2019-12-07 10:55:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:55:10,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:10,356 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 10:55:10,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2076093569, now seen corresponding path program 1 times [2019-12-07 10:55:10,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:10,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099882483] [2019-12-07 10:55:10,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:10,404 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 10:55:10,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099882483] [2019-12-07 10:55:10,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:10,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:10,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132437320] [2019-12-07 10:55:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:10,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:10,405 INFO L87 Difference]: Start difference. First operand 21928 states and 82711 transitions. Second operand 3 states. [2019-12-07 10:55:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:10,490 INFO L93 Difference]: Finished difference Result 20766 states and 77222 transitions. [2019-12-07 10:55:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:10,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:55:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:10,527 INFO L225 Difference]: With dead ends: 20766 [2019-12-07 10:55:10,527 INFO L226 Difference]: Without dead ends: 20766 [2019-12-07 10:55:10,527 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 10:55:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-12-07 10:55:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20282. [2019-12-07 10:55:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-12-07 10:55:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 75572 transitions. [2019-12-07 10:55:10,877 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 75572 transitions. Word has length 18 [2019-12-07 10:55:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:10,877 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 75572 transitions. [2019-12-07 10:55:10,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 75572 transitions. [2019-12-07 10:55:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:55:10,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:10,881 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 10:55:10,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1546230613, now seen corresponding path program 1 times [2019-12-07 10:55:10,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:10,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068330963] [2019-12-07 10:55:10,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:10,931 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 10:55:10,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068330963] [2019-12-07 10:55:10,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:10,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:55:10,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576223889] [2019-12-07 10:55:10,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:10,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:10,933 INFO L87 Difference]: Start difference. First operand 20282 states and 75572 transitions. Second operand 3 states. [2019-12-07 10:55:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:11,012 INFO L93 Difference]: Finished difference Result 20378 states and 75774 transitions. [2019-12-07 10:55:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:55:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:11,046 INFO L225 Difference]: With dead ends: 20378 [2019-12-07 10:55:11,046 INFO L226 Difference]: Without dead ends: 20378 [2019-12-07 10:55:11,046 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 10:55:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20378 states. [2019-12-07 10:55:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20378 to 20279. [2019-12-07 10:55:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-12-07 10:55:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 75560 transitions. [2019-12-07 10:55:11,429 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 75560 transitions. Word has length 18 [2019-12-07 10:55:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:11,429 INFO L462 AbstractCegarLoop]: Abstraction has 20279 states and 75560 transitions. [2019-12-07 10:55:11,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 75560 transitions. [2019-12-07 10:55:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:55:11,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:11,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:11,433 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash 876364753, now seen corresponding path program 1 times [2019-12-07 10:55:11,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:11,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836988114] [2019-12-07 10:55:11,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:11,480 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 10:55:11,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836988114] [2019-12-07 10:55:11,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:11,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:11,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64002819] [2019-12-07 10:55:11,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:11,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:11,482 INFO L87 Difference]: Start difference. First operand 20279 states and 75560 transitions. Second operand 4 states. [2019-12-07 10:55:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:11,557 INFO L93 Difference]: Finished difference Result 19992 states and 74483 transitions. [2019-12-07 10:55:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:11,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 10:55:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:11,590 INFO L225 Difference]: With dead ends: 19992 [2019-12-07 10:55:11,590 INFO L226 Difference]: Without dead ends: 19992 [2019-12-07 10:55:11,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2019-12-07 10:55:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 19992. [2019-12-07 10:55:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-12-07 10:55:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 74483 transitions. [2019-12-07 10:55:11,932 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 74483 transitions. Word has length 19 [2019-12-07 10:55:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:11,933 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 74483 transitions. [2019-12-07 10:55:11,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 74483 transitions. [2019-12-07 10:55:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:55:11,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:11,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:11,939 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1090694034, now seen corresponding path program 1 times [2019-12-07 10:55:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:11,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058240247] [2019-12-07 10:55:11,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:11,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058240247] [2019-12-07 10:55:11,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:11,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:11,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9661157] [2019-12-07 10:55:11,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:11,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:11,989 INFO L87 Difference]: Start difference. First operand 19992 states and 74483 transitions. Second operand 4 states. [2019-12-07 10:55:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:12,085 INFO L93 Difference]: Finished difference Result 20042 states and 74530 transitions. [2019-12-07 10:55:12,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:55:12,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 10:55:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:12,121 INFO L225 Difference]: With dead ends: 20042 [2019-12-07 10:55:12,121 INFO L226 Difference]: Without dead ends: 20042 [2019-12-07 10:55:12,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20042 states. [2019-12-07 10:55:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20042 to 19944. [2019-12-07 10:55:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19944 states. [2019-12-07 10:55:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19944 states to 19944 states and 74317 transitions. [2019-12-07 10:55:12,486 INFO L78 Accepts]: Start accepts. Automaton has 19944 states and 74317 transitions. Word has length 20 [2019-12-07 10:55:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:12,486 INFO L462 AbstractCegarLoop]: Abstraction has 19944 states and 74317 transitions. [2019-12-07 10:55:12,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19944 states and 74317 transitions. [2019-12-07 10:55:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:55:12,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:12,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:12,493 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 460041717, now seen corresponding path program 1 times [2019-12-07 10:55:12,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:12,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154450327] [2019-12-07 10:55:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:12,516 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 10:55:12,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154450327] [2019-12-07 10:55:12,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:12,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:55:12,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16599030] [2019-12-07 10:55:12,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:12,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:12,518 INFO L87 Difference]: Start difference. First operand 19944 states and 74317 transitions. Second operand 3 states. [2019-12-07 10:55:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:12,558 INFO L93 Difference]: Finished difference Result 11502 states and 37369 transitions. [2019-12-07 10:55:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:12,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:55:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:12,572 INFO L225 Difference]: With dead ends: 11502 [2019-12-07 10:55:12,572 INFO L226 Difference]: Without dead ends: 11502 [2019-12-07 10:55:12,572 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 10:55:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11502 states. [2019-12-07 10:55:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11502 to 11502. [2019-12-07 10:55:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-12-07 10:55:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 37369 transitions. [2019-12-07 10:55:12,731 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 37369 transitions. Word has length 21 [2019-12-07 10:55:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:12,731 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 37369 transitions. [2019-12-07 10:55:12,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 37369 transitions. [2019-12-07 10:55:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:55:12,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:12,735 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 10:55:12,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1095736327, now seen corresponding path program 1 times [2019-12-07 10:55:12,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:12,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614362622] [2019-12-07 10:55:12,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:12,784 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 10:55:12,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614362622] [2019-12-07 10:55:12,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:12,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:55:12,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565823826] [2019-12-07 10:55:12,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:55:12,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:12,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:55:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:12,785 INFO L87 Difference]: Start difference. First operand 11502 states and 37369 transitions. Second operand 5 states. [2019-12-07 10:55:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:12,870 INFO L93 Difference]: Finished difference Result 17709 states and 57631 transitions. [2019-12-07 10:55:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:55:12,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:55:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:12,882 INFO L225 Difference]: With dead ends: 17709 [2019-12-07 10:55:12,882 INFO L226 Difference]: Without dead ends: 9001 [2019-12-07 10:55:12,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:55:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2019-12-07 10:55:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 8952. [2019-12-07 10:55:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8952 states. [2019-12-07 10:55:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 28931 transitions. [2019-12-07 10:55:13,007 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 28931 transitions. Word has length 22 [2019-12-07 10:55:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,007 INFO L462 AbstractCegarLoop]: Abstraction has 8952 states and 28931 transitions. [2019-12-07 10:55:13,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:55:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 28931 transitions. [2019-12-07 10:55:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:55:13,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,010 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 10:55:13,010 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -38213151, now seen corresponding path program 2 times [2019-12-07 10:55:13,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164112104] [2019-12-07 10:55:13,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,041 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 10:55:13,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164112104] [2019-12-07 10:55:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:13,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563970031] [2019-12-07 10:55:13,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:13,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:13,042 INFO L87 Difference]: Start difference. First operand 8952 states and 28931 transitions. Second operand 4 states. [2019-12-07 10:55:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,062 INFO L93 Difference]: Finished difference Result 2139 states and 5647 transitions. [2019-12-07 10:55:13,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:55:13,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:55:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,065 INFO L225 Difference]: With dead ends: 2139 [2019-12-07 10:55:13,065 INFO L226 Difference]: Without dead ends: 2139 [2019-12-07 10:55:13,065 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 10:55:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-12-07 10:55:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-12-07 10:55:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-12-07 10:55:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 5647 transitions. [2019-12-07 10:55:13,088 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 5647 transitions. Word has length 22 [2019-12-07 10:55:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,088 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 5647 transitions. [2019-12-07 10:55:13,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 5647 transitions. [2019-12-07 10:55:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:55:13,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:13,090 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-12-07 10:55:13,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937493350] [2019-12-07 10:55:13,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,123 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 10:55:13,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937493350] [2019-12-07 10:55:13,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:13,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852815638] [2019-12-07 10:55:13,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:55:13,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:55:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:13,124 INFO L87 Difference]: Start difference. First operand 2139 states and 5647 transitions. Second operand 5 states. [2019-12-07 10:55:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,224 INFO L93 Difference]: Finished difference Result 2884 states and 7387 transitions. [2019-12-07 10:55:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:55:13,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 10:55:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,228 INFO L225 Difference]: With dead ends: 2884 [2019-12-07 10:55:13,228 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 10:55:13,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:55:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 10:55:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2193. [2019-12-07 10:55:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-12-07 10:55:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5754 transitions. [2019-12-07 10:55:13,251 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5754 transitions. Word has length 29 [2019-12-07 10:55:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,251 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 5754 transitions. [2019-12-07 10:55:13,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:55:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5754 transitions. [2019-12-07 10:55:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:55:13,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:13,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1377421728, now seen corresponding path program 1 times [2019-12-07 10:55:13,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287913575] [2019-12-07 10:55:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:55:13,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287913575] [2019-12-07 10:55:13,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:13,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709733399] [2019-12-07 10:55:13,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:55:13,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:55:13,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:55:13,278 INFO L87 Difference]: Start difference. First operand 2193 states and 5754 transitions. Second operand 3 states. [2019-12-07 10:55:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,306 INFO L93 Difference]: Finished difference Result 2593 states and 6438 transitions. [2019-12-07 10:55:13,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:55:13,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 10:55:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,309 INFO L225 Difference]: With dead ends: 2593 [2019-12-07 10:55:13,309 INFO L226 Difference]: Without dead ends: 2593 [2019-12-07 10:55:13,309 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 10:55:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-12-07 10:55:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2157. [2019-12-07 10:55:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-12-07 10:55:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 5350 transitions. [2019-12-07 10:55:13,329 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 5350 transitions. Word has length 29 [2019-12-07 10:55:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,329 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 5350 transitions. [2019-12-07 10:55:13,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:55:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 5350 transitions. [2019-12-07 10:55:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:55:13,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,331 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] [2019-12-07 10:55:13,331 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -834134890, now seen corresponding path program 1 times [2019-12-07 10:55:13,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107558444] [2019-12-07 10:55:13,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,369 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 10:55:13,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107558444] [2019-12-07 10:55:13,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:13,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060808254] [2019-12-07 10:55:13,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:55:13,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:55:13,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:13,371 INFO L87 Difference]: Start difference. First operand 2157 states and 5350 transitions. Second operand 5 states. [2019-12-07 10:55:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,505 INFO L93 Difference]: Finished difference Result 2648 states and 6508 transitions. [2019-12-07 10:55:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:55:13,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 10:55:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,508 INFO L225 Difference]: With dead ends: 2648 [2019-12-07 10:55:13,508 INFO L226 Difference]: Without dead ends: 2565 [2019-12-07 10:55:13,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:55:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-12-07 10:55:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2031. [2019-12-07 10:55:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-12-07 10:55:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 5056 transitions. [2019-12-07 10:55:13,529 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 5056 transitions. Word has length 30 [2019-12-07 10:55:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,529 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 5056 transitions. [2019-12-07 10:55:13,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:55:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 5056 transitions. [2019-12-07 10:55:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:55:13,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:13,531 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1660300154, now seen corresponding path program 1 times [2019-12-07 10:55:13,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239915483] [2019-12-07 10:55:13,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,569 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 10:55:13,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239915483] [2019-12-07 10:55:13,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:55:13,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641928342] [2019-12-07 10:55:13,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:55:13,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:55:13,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:55:13,571 INFO L87 Difference]: Start difference. First operand 2031 states and 5056 transitions. Second operand 5 states. [2019-12-07 10:55:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,593 INFO L93 Difference]: Finished difference Result 1223 states and 3152 transitions. [2019-12-07 10:55:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:55:13,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:55:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,594 INFO L225 Difference]: With dead ends: 1223 [2019-12-07 10:55:13,594 INFO L226 Difference]: Without dead ends: 1223 [2019-12-07 10:55:13,594 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 10:55:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-07 10:55:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2019-12-07 10:55:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 10:55:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3152 transitions. [2019-12-07 10:55:13,605 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3152 transitions. Word has length 31 [2019-12-07 10:55:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,606 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3152 transitions. [2019-12-07 10:55:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:55:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3152 transitions. [2019-12-07 10:55:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:55:13,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:13,608 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 204691235, now seen corresponding path program 1 times [2019-12-07 10:55:13,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464504765] [2019-12-07 10:55:13,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:13,679 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 10:55:13,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464504765] [2019-12-07 10:55:13,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:13,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:55:13,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834001690] [2019-12-07 10:55:13,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:55:13,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:13,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:55:13,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:55:13,681 INFO L87 Difference]: Start difference. First operand 1223 states and 3152 transitions. Second operand 7 states. [2019-12-07 10:55:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:13,861 INFO L93 Difference]: Finished difference Result 3339 states and 8535 transitions. [2019-12-07 10:55:13,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:55:13,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 10:55:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:13,864 INFO L225 Difference]: With dead ends: 3339 [2019-12-07 10:55:13,864 INFO L226 Difference]: Without dead ends: 2759 [2019-12-07 10:55:13,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:55:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-12-07 10:55:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1655. [2019-12-07 10:55:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-12-07 10:55:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4144 transitions. [2019-12-07 10:55:13,885 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 4144 transitions. Word has length 45 [2019-12-07 10:55:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:13,885 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 4144 transitions. [2019-12-07 10:55:13,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:55:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 4144 transitions. [2019-12-07 10:55:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:55:13,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:13,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:13,888 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash -162970969, now seen corresponding path program 2 times [2019-12-07 10:55:13,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:13,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239686698] [2019-12-07 10:55:13,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:14,092 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 10:55:14,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239686698] [2019-12-07 10:55:14,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:14,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:55:14,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517835758] [2019-12-07 10:55:14,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:55:14,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:55:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:55:14,095 INFO L87 Difference]: Start difference. First operand 1655 states and 4144 transitions. Second operand 13 states. [2019-12-07 10:55:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:15,974 INFO L93 Difference]: Finished difference Result 3650 states and 8591 transitions. [2019-12-07 10:55:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:55:15,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-12-07 10:55:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:15,976 INFO L225 Difference]: With dead ends: 3650 [2019-12-07 10:55:15,976 INFO L226 Difference]: Without dead ends: 2583 [2019-12-07 10:55:15,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:55:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-07 10:55:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1607. [2019-12-07 10:55:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-07 10:55:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4024 transitions. [2019-12-07 10:55:15,994 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4024 transitions. Word has length 45 [2019-12-07 10:55:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:15,994 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4024 transitions. [2019-12-07 10:55:15,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:55:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4024 transitions. [2019-12-07 10:55:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:55:15,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:15,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:15,996 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash 664400937, now seen corresponding path program 3 times [2019-12-07 10:55:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:15,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371194457] [2019-12-07 10:55:15,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:16,032 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 10:55:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371194457] [2019-12-07 10:55:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:55:16,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:55:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969456555] [2019-12-07 10:55:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:55:16,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:55:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:55:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:55:16,033 INFO L87 Difference]: Start difference. First operand 1607 states and 4024 transitions. Second operand 4 states. [2019-12-07 10:55:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:16,046 INFO L93 Difference]: Finished difference Result 2087 states and 5045 transitions. [2019-12-07 10:55:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:55:16,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 10:55:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:16,047 INFO L225 Difference]: With dead ends: 2087 [2019-12-07 10:55:16,047 INFO L226 Difference]: Without dead ends: 518 [2019-12-07 10:55:16,047 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 10:55:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-07 10:55:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2019-12-07 10:55:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 10:55:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1086 transitions. [2019-12-07 10:55:16,051 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1086 transitions. Word has length 45 [2019-12-07 10:55:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:16,051 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 1086 transitions. [2019-12-07 10:55:16,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:55:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1086 transitions. [2019-12-07 10:55:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:55:16,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:16,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:55:16,052 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:55:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 4 times [2019-12-07 10:55:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:55:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154175101] [2019-12-07 10:55:16,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:55:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:55:16,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:55:16,119 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:55:16,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t864~0.base_36| 4) |v_#length_25|) (= v_~z$mem_tmp~0_20 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t864~0.base_36|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t864~0.base_36|) 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t864~0.base_36| 1)) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t864~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t864~0.base_36|) |v_ULTIMATE.start_main_~#t864~0.offset_25| 0)) |v_#memory_int_17|) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88) (= 0 |v_ULTIMATE.start_main_~#t864~0.offset_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t864~0.base=|v_ULTIMATE.start_main_~#t864~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ULTIMATE.start_main_~#t865~0.offset=|v_ULTIMATE.start_main_~#t865~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t866~0.offset=|v_ULTIMATE.start_main_~#t866~0.offset_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ULTIMATE.start_main_~#t865~0.base=|v_ULTIMATE.start_main_~#t865~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t866~0.base=|v_ULTIMATE.start_main_~#t866~0.base_25|, ULTIMATE.start_main_~#t864~0.offset=|v_ULTIMATE.start_main_~#t864~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t864~0.base, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t865~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t866~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t865~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t866~0.base, ULTIMATE.start_main_~#t864~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:55:16,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t865~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t865~0.base_10| 4) |v_#length_13|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t865~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t865~0.base_10|) |v_ULTIMATE.start_main_~#t865~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t865~0.offset_9| 0) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t865~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t865~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t865~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t865~0.offset=|v_ULTIMATE.start_main_~#t865~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t865~0.base=|v_ULTIMATE.start_main_~#t865~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t865~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t865~0.base, #length] because there is no mapped edge [2019-12-07 10:55:16,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (not (= |v_ULTIMATE.start_main_~#t866~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t866~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t866~0.base_13|) |v_ULTIMATE.start_main_~#t866~0.offset_11| 2))) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t866~0.base_13| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t866~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t866~0.base_13|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t866~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t866~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t866~0.base=|v_ULTIMATE.start_main_~#t866~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t866~0.offset=|v_ULTIMATE.start_main_~#t866~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t866~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t866~0.offset, #length] because there is no mapped edge [2019-12-07 10:55:16,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963) (= ~z$w_buff0_used~0_Out-364999963 1) (= |P2Thread1of1ForFork0_#in~arg.base_In-364999963| P2Thread1of1ForFork0_~arg.base_Out-364999963) (= P2Thread1of1ForFork0_~arg.offset_Out-364999963 |P2Thread1of1ForFork0_#in~arg.offset_In-364999963|) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-364999963 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out-364999963 256))))) 1 0)) (= ~z$w_buff0~0_Out-364999963 1) (= ~z$w_buff1_used~0_Out-364999963 ~z$w_buff0_used~0_In-364999963) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963 0)) (= ~z$w_buff1~0_Out-364999963 ~z$w_buff0~0_In-364999963)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-364999963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$w_buff0~0=~z$w_buff0~0_In-364999963, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-364999963|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-364999963, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-364999963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-364999963, ~z$w_buff0~0=~z$w_buff0~0_Out-364999963, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-364999963, ~z$w_buff1~0=~z$w_buff1~0_Out-364999963, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-364999963|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:55:16,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:55:16,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1674008036 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1674008036 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1674008036|)) (and (= ~z$w_buff0_used~0_In-1674008036 |P2Thread1of1ForFork0_#t~ite28_Out-1674008036|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1674008036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1674008036} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1674008036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1674008036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1674008036} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:55:16,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-538905590 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-538905590 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-538905590 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-538905590 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-538905590| ~z$w_buff1_used~0_In-538905590) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-538905590| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-538905590, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-538905590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-538905590, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-538905590} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-538905590, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-538905590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-538905590, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-538905590, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-538905590|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:55:16,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-867671207 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-867671207 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_Out-867671207 ~z$r_buff0_thd3~0_In-867671207))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-867671207 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-867671207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-867671207} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-867671207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-867671207, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-867671207|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 10:55:16,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-219265686 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-219265686 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-219265686 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-219265686 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite31_Out-219265686| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite31_Out-219265686| ~z$r_buff1_thd3~0_In-219265686) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-219265686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219265686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219265686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219265686} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-219265686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219265686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219265686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219265686, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-219265686|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:55:16,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:55:16,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:55:16,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:55:16,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:55:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2130650313 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2130650313 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In2130650313 |ULTIMATE.start_main_#t~ite35_Out2130650313|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2130650313| ~z$w_buff1~0_In2130650313)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130650313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130650313, ~z$w_buff1~0=~z$w_buff1~0_In2130650313, ~z~0=~z~0_In2130650313} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130650313, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2130650313|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130650313, ~z$w_buff1~0=~z$w_buff1~0_In2130650313, ~z~0=~z~0_In2130650313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 10:55:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 10:55:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2071459582 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2071459582 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out2071459582|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out2071459582| ~z$w_buff0_used~0_In2071459582)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2071459582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2071459582} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2071459582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2071459582, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2071459582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:55:16,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1720110780 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1720110780 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1720110780 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1720110780 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1720110780 |ULTIMATE.start_main_#t~ite38_Out1720110780|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1720110780|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1720110780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1720110780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1720110780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1720110780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1720110780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1720110780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1720110780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1720110780, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1720110780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:55:16,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2023923834 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2023923834 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-2023923834| ~z$r_buff0_thd0~0_In-2023923834) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-2023923834| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2023923834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:55:16,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2044804699 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2044804699 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2044804699 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2044804699 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2044804699| ~z$r_buff1_thd0~0_In2044804699) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out2044804699|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044804699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044804699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044804699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044804699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044804699, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2044804699|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044804699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044804699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044804699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:55:16,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:55:16,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:55:16 BasicIcfg [2019-12-07 10:55:16,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:55:16,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:55:16,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:55:16,196 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:55:16,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:55:02" (3/4) ... [2019-12-07 10:55:16,199 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:55:16,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t864~0.base_36| 4) |v_#length_25|) (= v_~z$mem_tmp~0_20 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t864~0.base_36|) (= v_~z$w_buff0_used~0_485 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t864~0.base_36|) 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t864~0.base_36| 1)) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t864~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t864~0.base_36|) |v_ULTIMATE.start_main_~#t864~0.offset_25| 0)) |v_#memory_int_17|) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_#NULL.base_3|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88) (= 0 |v_ULTIMATE.start_main_~#t864~0.offset_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t864~0.base=|v_ULTIMATE.start_main_~#t864~0.base_36|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ULTIMATE.start_main_~#t865~0.offset=|v_ULTIMATE.start_main_~#t865~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t866~0.offset=|v_ULTIMATE.start_main_~#t866~0.offset_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ULTIMATE.start_main_~#t865~0.base=|v_ULTIMATE.start_main_~#t865~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t866~0.base=|v_ULTIMATE.start_main_~#t866~0.base_25|, ULTIMATE.start_main_~#t864~0.offset=|v_ULTIMATE.start_main_~#t864~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t864~0.base, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t865~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t866~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t865~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t866~0.base, ULTIMATE.start_main_~#t864~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:55:16,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t865~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t865~0.base_10| 4) |v_#length_13|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t865~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t865~0.base_10|) |v_ULTIMATE.start_main_~#t865~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t865~0.offset_9| 0) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t865~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t865~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t865~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t865~0.offset=|v_ULTIMATE.start_main_~#t865~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t865~0.base=|v_ULTIMATE.start_main_~#t865~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t865~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t865~0.base, #length] because there is no mapped edge [2019-12-07 10:55:16,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (not (= |v_ULTIMATE.start_main_~#t866~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t866~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t866~0.base_13|) |v_ULTIMATE.start_main_~#t866~0.offset_11| 2))) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t866~0.base_13| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t866~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t866~0.base_13|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t866~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t866~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t866~0.base=|v_ULTIMATE.start_main_~#t866~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t866~0.offset=|v_ULTIMATE.start_main_~#t866~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t866~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t866~0.offset, #length] because there is no mapped edge [2019-12-07 10:55:16,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963) (= ~z$w_buff0_used~0_Out-364999963 1) (= |P2Thread1of1ForFork0_#in~arg.base_In-364999963| P2Thread1of1ForFork0_~arg.base_Out-364999963) (= P2Thread1of1ForFork0_~arg.offset_Out-364999963 |P2Thread1of1ForFork0_#in~arg.offset_In-364999963|) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-364999963 256))) (not (= 0 (mod ~z$w_buff0_used~0_Out-364999963 256))))) 1 0)) (= ~z$w_buff0~0_Out-364999963 1) (= ~z$w_buff1_used~0_Out-364999963 ~z$w_buff0_used~0_In-364999963) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963 0)) (= ~z$w_buff1~0_Out-364999963 ~z$w_buff0~0_In-364999963)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-364999963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364999963, ~z$w_buff0~0=~z$w_buff0~0_In-364999963, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-364999963|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-364999963, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-364999963|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-364999963|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-364999963, ~z$w_buff0~0=~z$w_buff0~0_Out-364999963, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-364999963, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-364999963, ~z$w_buff1~0=~z$w_buff1~0_Out-364999963, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-364999963|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-364999963} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:55:16,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:55:16,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1674008036 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1674008036 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1674008036|)) (and (= ~z$w_buff0_used~0_In-1674008036 |P2Thread1of1ForFork0_#t~ite28_Out-1674008036|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1674008036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1674008036} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1674008036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1674008036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1674008036} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:55:16,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-538905590 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-538905590 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-538905590 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-538905590 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-538905590| ~z$w_buff1_used~0_In-538905590) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-538905590| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-538905590, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-538905590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-538905590, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-538905590} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-538905590, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-538905590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-538905590, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-538905590, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-538905590|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:55:16,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-867671207 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-867671207 256) 0)) (.cse2 (= ~z$r_buff0_thd3~0_Out-867671207 ~z$r_buff0_thd3~0_In-867671207))) (or (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-867671207 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-867671207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-867671207} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-867671207, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-867671207, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-867671207|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 10:55:16,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-219265686 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-219265686 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-219265686 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-219265686 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite31_Out-219265686| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite31_Out-219265686| ~z$r_buff1_thd3~0_In-219265686) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-219265686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219265686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219265686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219265686} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-219265686, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-219265686, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-219265686, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-219265686, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-219265686|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:55:16,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 10:55:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:55:16,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 10:55:16,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:55:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2130650313 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2130650313 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In2130650313 |ULTIMATE.start_main_#t~ite35_Out2130650313|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2130650313| ~z$w_buff1~0_In2130650313)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130650313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130650313, ~z$w_buff1~0=~z$w_buff1~0_In2130650313, ~z~0=~z~0_In2130650313} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2130650313, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2130650313|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2130650313, ~z$w_buff1~0=~z$w_buff1~0_In2130650313, ~z~0=~z~0_In2130650313} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 10:55:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 10:55:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2071459582 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2071459582 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out2071459582|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out2071459582| ~z$w_buff0_used~0_In2071459582)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2071459582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2071459582} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2071459582, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2071459582, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2071459582|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:55:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1720110780 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1720110780 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1720110780 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1720110780 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1720110780 |ULTIMATE.start_main_#t~ite38_Out1720110780|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1720110780|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1720110780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1720110780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1720110780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1720110780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1720110780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1720110780, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1720110780, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1720110780, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1720110780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:55:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-2023923834 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-2023923834 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-2023923834| ~z$r_buff0_thd0~0_In-2023923834) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-2023923834| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2023923834, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2023923834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023923834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:55:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2044804699 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2044804699 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2044804699 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2044804699 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2044804699| ~z$r_buff1_thd0~0_In2044804699) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out2044804699|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044804699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044804699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044804699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044804699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2044804699, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2044804699|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2044804699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044804699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044804699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:55:16,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:55:16,269 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3b60658-7da6-425e-bc63-36daf069751d/bin/uautomizer/witness.graphml [2019-12-07 10:55:16,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:55:16,270 INFO L168 Benchmark]: Toolchain (without parser) took 14537.94 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 989.9 MB). Free memory was 935.5 MB in the beginning and 1.5 GB in the end (delta: -570.8 MB). Peak memory consumption was 419.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,270 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:55:16,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,271 INFO L168 Benchmark]: Boogie Preprocessor took 24.23 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 10:55:16,272 INFO L168 Benchmark]: RCFGBuilder took 362.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,272 INFO L168 Benchmark]: TraceAbstraction took 13650.03 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 890.8 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -520.9 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,273 INFO L168 Benchmark]: Witness Printer took 72.95 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:55:16,274 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.23 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 362.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13650.03 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 890.8 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -520.9 MB). Peak memory consumption was 369.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.95 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t864, ((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, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t865, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t866, ((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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z 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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\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=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2531 SDtfs, 2280 SDslu, 5435 SDs, 0 SdLazy, 3194 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21928occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 17135 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 78969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...