./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/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 73d062f571b15de43af4978f822ef6801d9be335 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:20:06,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:20:06,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:20:06,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:20:06,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:20:06,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:20:06,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:20:06,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:20:06,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:20:06,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:20:06,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:20:06,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:20:06,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:20:06,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:20:06,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:20:06,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:20:06,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:20:06,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:20:06,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:20:06,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:20:06,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:20:06,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:20:06,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:20:06,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:20:06,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:20:06,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:20:06,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:20:06,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:20:06,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:20:06,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:20:06,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:20:06,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:20:06,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:20:06,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:20:06,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:20:06,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:20:06,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:20:06,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:20:06,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:20:06,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:20:06,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:20:06,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:20:06,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:20:06,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:20:06,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:20:06,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:20:06,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:20:06,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:20:06,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:20:06,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:20:06,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:20:06,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:20:06,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:20:06,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:20:06,118 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_aafd80ea-b185-4faa-81a4-b993f84ea233/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 -> 73d062f571b15de43af4978f822ef6801d9be335 [2019-12-07 18:20:06,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:20:06,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:20:06,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:20:06,230 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:20:06,231 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:20:06,231 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-12-07 18:20:06,275 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/data/ddf9fa1fd/5878222b683940399448138efe2a20fc/FLAG74cd420c3 [2019-12-07 18:20:06,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:20:06,743 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-12-07 18:20:06,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/data/ddf9fa1fd/5878222b683940399448138efe2a20fc/FLAG74cd420c3 [2019-12-07 18:20:06,766 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/data/ddf9fa1fd/5878222b683940399448138efe2a20fc [2019-12-07 18:20:06,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:20:06,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:20:06,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:06,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:20:06,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:20:06,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:06" (1/1) ... [2019-12-07 18:20:06,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:06, skipping insertion in model container [2019-12-07 18:20:06,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:20:06" (1/1) ... [2019-12-07 18:20:06,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:20:06,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:20:07,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:07,075 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:20:07,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:20:07,161 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:20:07,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07 WrapperNode [2019-12-07 18:20:07,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:20:07,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:07,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:20:07,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:20:07,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:20:07,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:20:07,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:20:07,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:20:07,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... [2019-12-07 18:20:07,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:20:07,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:20:07,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:20:07,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:20:07,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:20:07,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:20:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:20:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:20:07,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:20:07,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:20:07,267 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:20:07,597 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:20:07,598 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:20:07,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:07 BoogieIcfgContainer [2019-12-07 18:20:07,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:20:07,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:20:07,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:20:07,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:20:07,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:20:06" (1/3) ... [2019-12-07 18:20:07,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f66b38f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:07, skipping insertion in model container [2019-12-07 18:20:07,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:20:07" (2/3) ... [2019-12-07 18:20:07,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f66b38f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:20:07, skipping insertion in model container [2019-12-07 18:20:07,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:07" (3/3) ... [2019-12-07 18:20:07,603 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-12-07 18:20:07,609 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:20:07,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:20:07,613 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:20:07,614 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:20:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:20:07,664 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:20:07,676 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:20:07,676 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:20:07,676 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:20:07,676 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:20:07,676 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:20:07,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:20:07,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:20:07,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:20:07,686 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-07 18:20:07,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 18:20:07,734 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 18:20:07,734 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:20:07,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:20:07,753 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-07 18:20:07,778 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-07 18:20:07,778 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:20:07,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 18:20:07,792 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 18:20:07,792 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:20:10,524 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 18:20:10,785 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-07 18:20:10,785 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 18:20:10,787 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 18:20:11,148 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-07 18:20:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-07 18:20:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:20:11,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:11,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:20:11,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-07 18:20:11,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:11,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11185917] [2019-12-07 18:20:11,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:11,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11185917] [2019-12-07 18:20:11,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:11,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:11,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703143813] [2019-12-07 18:20:11,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:11,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:11,315 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-07 18:20:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:11,473 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-07 18:20:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:11,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:20:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:11,532 INFO L225 Difference]: With dead ends: 8460 [2019-12-07 18:20:11,533 INFO L226 Difference]: Without dead ends: 7472 [2019-12-07 18:20:11,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-07 18:20:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-07 18:20:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-07 18:20:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-07 18:20:11,810 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-07 18:20:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:11,810 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-07 18:20:11,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-07 18:20:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:20:11,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:11,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:11,813 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-07 18:20:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:11,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284650106] [2019-12-07 18:20:11,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:11,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284650106] [2019-12-07 18:20:11,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:11,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:11,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127718222] [2019-12-07 18:20:11,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:11,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:11,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:11,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:11,879 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-07 18:20:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:12,119 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-07 18:20:12,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:12,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:20:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:12,181 INFO L225 Difference]: With dead ends: 11704 [2019-12-07 18:20:12,181 INFO L226 Difference]: Without dead ends: 11690 [2019-12-07 18:20:12,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-07 18:20:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-07 18:20:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-07 18:20:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-07 18:20:12,425 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-07 18:20:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:12,425 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-07 18:20:12,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-07 18:20:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:20:12,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:12,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:12,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-07 18:20:12,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:12,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 18:20:12,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:12,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 18:20:12,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:12,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:12,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238149155] [2019-12-07 18:20:12,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:12,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:12,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:12,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:12,510 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-07 18:20:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:12,779 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-07 18:20:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:20:12,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 18:20:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:12,815 INFO L225 Difference]: With dead ends: 15000 [2019-12-07 18:20:12,816 INFO L226 Difference]: Without dead ends: 15000 [2019-12-07 18:20:12,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-07 18:20:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-07 18:20:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-07 18:20:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-07 18:20:13,105 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-07 18:20:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:13,106 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-07 18:20:13,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-07 18:20:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:20:13,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:13,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:13,109 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-07 18:20:13,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:13,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956683485] [2019-12-07 18:20:13,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:13,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956683485] [2019-12-07 18:20:13,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:13,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:13,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813016535] [2019-12-07 18:20:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:13,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:13,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:13,166 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-07 18:20:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:13,204 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-12-07 18:20:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:20:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:13,230 INFO L225 Difference]: With dead ends: 11886 [2019-12-07 18:20:13,230 INFO L226 Difference]: Without dead ends: 11886 [2019-12-07 18:20:13,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-12-07 18:20:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-12-07 18:20:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-12-07 18:20:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-12-07 18:20:13,406 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-12-07 18:20:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:13,406 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-12-07 18:20:13,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-12-07 18:20:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:20:13,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:13,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:13,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-12-07 18:20:13,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:13,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413438222] [2019-12-07 18:20:13,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:13,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413438222] [2019-12-07 18:20:13,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:13,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:13,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371031719] [2019-12-07 18:20:13,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:13,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:13,453 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 3 states. [2019-12-07 18:20:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:13,511 INFO L93 Difference]: Finished difference Result 20097 states and 61984 transitions. [2019-12-07 18:20:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:13,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:20:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:13,533 INFO L225 Difference]: With dead ends: 20097 [2019-12-07 18:20:13,533 INFO L226 Difference]: Without dead ends: 17619 [2019-12-07 18:20:13,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17619 states. [2019-12-07 18:20:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17619 to 16855. [2019-12-07 18:20:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16855 states. [2019-12-07 18:20:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16855 states to 16855 states and 52512 transitions. [2019-12-07 18:20:13,823 INFO L78 Accepts]: Start accepts. Automaton has 16855 states and 52512 transitions. Word has length 16 [2019-12-07 18:20:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:13,823 INFO L462 AbstractCegarLoop]: Abstraction has 16855 states and 52512 transitions. [2019-12-07 18:20:13,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 16855 states and 52512 transitions. [2019-12-07 18:20:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:20:13,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:13,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:13,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-07 18:20:13,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:13,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725704999] [2019-12-07 18:20:13,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:13,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725704999] [2019-12-07 18:20:13,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:13,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:13,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066969617] [2019-12-07 18:20:13,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:13,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:13,877 INFO L87 Difference]: Start difference. First operand 16855 states and 52512 transitions. Second operand 4 states. [2019-12-07 18:20:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:13,899 INFO L93 Difference]: Finished difference Result 2989 states and 7615 transitions. [2019-12-07 18:20:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:13,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:20:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:13,901 INFO L225 Difference]: With dead ends: 2989 [2019-12-07 18:20:13,901 INFO L226 Difference]: Without dead ends: 2059 [2019-12-07 18:20:13,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-12-07 18:20:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2019-12-07 18:20:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-12-07 18:20:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 4626 transitions. [2019-12-07 18:20:13,922 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 4626 transitions. Word has length 17 [2019-12-07 18:20:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:13,922 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 4626 transitions. [2019-12-07 18:20:13,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 4626 transitions. [2019-12-07 18:20:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:20:13,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:13,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:13,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-07 18:20:13,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:13,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278935848] [2019-12-07 18:20:13,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:13,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278935848] [2019-12-07 18:20:13,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:13,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:13,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677676276] [2019-12-07 18:20:13,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:20:13,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:20:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:20:13,974 INFO L87 Difference]: Start difference. First operand 2059 states and 4626 transitions. Second operand 6 states. [2019-12-07 18:20:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:14,223 INFO L93 Difference]: Finished difference Result 2885 states and 6208 transitions. [2019-12-07 18:20:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:20:14,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 18:20:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:14,225 INFO L225 Difference]: With dead ends: 2885 [2019-12-07 18:20:14,225 INFO L226 Difference]: Without dead ends: 2834 [2019-12-07 18:20:14,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:20:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2019-12-07 18:20:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2017. [2019-12-07 18:20:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-12-07 18:20:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4535 transitions. [2019-12-07 18:20:14,248 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4535 transitions. Word has length 25 [2019-12-07 18:20:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:14,248 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 4535 transitions. [2019-12-07 18:20:14,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:20:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4535 transitions. [2019-12-07 18:20:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:20:14,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:14,250 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] [2019-12-07 18:20:14,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-07 18:20:14,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:14,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482839306] [2019-12-07 18:20:14,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:14,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482839306] [2019-12-07 18:20:14,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:14,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:20:14,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761275443] [2019-12-07 18:20:14,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:14,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:14,317 INFO L87 Difference]: Start difference. First operand 2017 states and 4535 transitions. Second operand 5 states. [2019-12-07 18:20:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:14,346 INFO L93 Difference]: Finished difference Result 1101 states and 2460 transitions. [2019-12-07 18:20:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:14,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:20:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:14,348 INFO L225 Difference]: With dead ends: 1101 [2019-12-07 18:20:14,348 INFO L226 Difference]: Without dead ends: 983 [2019-12-07 18:20:14,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-12-07 18:20:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 707. [2019-12-07 18:20:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-07 18:20:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1554 transitions. [2019-12-07 18:20:14,358 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1554 transitions. Word has length 28 [2019-12-07 18:20:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:14,358 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1554 transitions. [2019-12-07 18:20:14,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1554 transitions. [2019-12-07 18:20:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:20:14,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:14,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:14,360 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:14,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-07 18:20:14,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:14,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448150668] [2019-12-07 18:20:14,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:14,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448150668] [2019-12-07 18:20:14,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:14,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:14,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813641876] [2019-12-07 18:20:14,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:14,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:14,399 INFO L87 Difference]: Start difference. First operand 707 states and 1554 transitions. Second operand 3 states. [2019-12-07 18:20:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:14,425 INFO L93 Difference]: Finished difference Result 1066 states and 2274 transitions. [2019-12-07 18:20:14,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:14,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:20:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:14,426 INFO L225 Difference]: With dead ends: 1066 [2019-12-07 18:20:14,427 INFO L226 Difference]: Without dead ends: 1066 [2019-12-07 18:20:14,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-07 18:20:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 806. [2019-12-07 18:20:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-12-07 18:20:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1751 transitions. [2019-12-07 18:20:14,435 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1751 transitions. Word has length 52 [2019-12-07 18:20:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:14,435 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1751 transitions. [2019-12-07 18:20:14,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1751 transitions. [2019-12-07 18:20:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:20:14,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:14,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:14,436 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-07 18:20:14,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:14,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941038916] [2019-12-07 18:20:14,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:14,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941038916] [2019-12-07 18:20:14,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:14,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:14,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712184720] [2019-12-07 18:20:14,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:14,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:14,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:14,483 INFO L87 Difference]: Start difference. First operand 806 states and 1751 transitions. Second operand 3 states. [2019-12-07 18:20:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:14,516 INFO L93 Difference]: Finished difference Result 1015 states and 2185 transitions. [2019-12-07 18:20:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:14,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 18:20:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:14,517 INFO L225 Difference]: With dead ends: 1015 [2019-12-07 18:20:14,517 INFO L226 Difference]: Without dead ends: 1015 [2019-12-07 18:20:14,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-07 18:20:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 782. [2019-12-07 18:20:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-07 18:20:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1716 transitions. [2019-12-07 18:20:14,524 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1716 transitions. Word has length 52 [2019-12-07 18:20:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:14,524 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1716 transitions. [2019-12-07 18:20:14,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1716 transitions. [2019-12-07 18:20:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:20:14,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:14,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:14,526 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash -802094331, now seen corresponding path program 1 times [2019-12-07 18:20:14,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:14,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917295371] [2019-12-07 18:20:14,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:14,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917295371] [2019-12-07 18:20:14,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:14,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:20:14,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175053816] [2019-12-07 18:20:14,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:20:14,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:20:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:20:14,760 INFO L87 Difference]: Start difference. First operand 782 states and 1716 transitions. Second operand 12 states. [2019-12-07 18:20:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:16,306 INFO L93 Difference]: Finished difference Result 3596 states and 7564 transitions. [2019-12-07 18:20:16,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:20:16,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 18:20:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:16,308 INFO L225 Difference]: With dead ends: 3596 [2019-12-07 18:20:16,308 INFO L226 Difference]: Without dead ends: 2036 [2019-12-07 18:20:16,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:20:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-07 18:20:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 864. [2019-12-07 18:20:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-12-07 18:20:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1901 transitions. [2019-12-07 18:20:16,319 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1901 transitions. Word has length 53 [2019-12-07 18:20:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:16,319 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1901 transitions. [2019-12-07 18:20:16,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:20:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1901 transitions. [2019-12-07 18:20:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:20:16,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:16,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:16,320 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:16,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2018843623, now seen corresponding path program 2 times [2019-12-07 18:20:16,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:16,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482028197] [2019-12-07 18:20:16,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:16,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482028197] [2019-12-07 18:20:16,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:16,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:20:16,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588161010] [2019-12-07 18:20:16,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:20:16,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:20:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:16,401 INFO L87 Difference]: Start difference. First operand 864 states and 1901 transitions. Second operand 7 states. [2019-12-07 18:20:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:16,547 INFO L93 Difference]: Finished difference Result 2281 states and 4826 transitions. [2019-12-07 18:20:16,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:20:16,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 18:20:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:16,549 INFO L225 Difference]: With dead ends: 2281 [2019-12-07 18:20:16,549 INFO L226 Difference]: Without dead ends: 1657 [2019-12-07 18:20:16,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:20:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-12-07 18:20:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 872. [2019-12-07 18:20:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-07 18:20:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1905 transitions. [2019-12-07 18:20:16,558 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1905 transitions. Word has length 53 [2019-12-07 18:20:16,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:16,558 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1905 transitions. [2019-12-07 18:20:16,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:20:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1905 transitions. [2019-12-07 18:20:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 18:20:16,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:16,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:16,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 3 times [2019-12-07 18:20:16,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:16,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505602413] [2019-12-07 18:20:16,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:16,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:20:16,637 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:20:16,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1445~0.base_35|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35|) 0) (= v_~y~0_135 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1445~0.base_35| 4)) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35|) |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0))) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35| 1)) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_17|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:16,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd1~0_Out-294244269 ~y$r_buff0_thd1~0_In-294244269) (= 1 ~y$r_buff0_thd1~0_Out-294244269) (= ~y$r_buff1_thd2~0_Out-294244269 ~y$r_buff0_thd2~0_In-294244269) (= ~x~0_Out-294244269 1) (= ~y$r_buff1_thd0~0_Out-294244269 ~y$r_buff0_thd0~0_In-294244269) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-294244269, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269, ~x~0=~x~0_Out-294244269, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-294244269} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:20:16,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-12-07 18:20:16,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1377282913 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1377282913 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1377282913| ~y$w_buff0_used~0_In1377282913) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1377282913|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1377282913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1377282913} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1377282913|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1377282913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1377282913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:20:16,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In408465644 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out408465644| ~y$w_buff0~0_In408465644) (= |P1Thread1of1ForFork1_#t~ite14_In408465644| |P1Thread1of1ForFork1_#t~ite14_Out408465644|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In408465644 256) 0))) (or (= (mod ~y$w_buff0_used~0_In408465644 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In408465644 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In408465644 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite15_Out408465644| |P1Thread1of1ForFork1_#t~ite14_Out408465644|) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out408465644| ~y$w_buff0~0_In408465644)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In408465644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$w_buff0~0=~y$w_buff0~0_In408465644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In408465644, ~weak$$choice2~0=~weak$$choice2~0_In408465644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In408465644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In408465644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$w_buff0~0=~y$w_buff0~0_In408465644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In408465644, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out408465644|, ~weak$$choice2~0=~weak$$choice2~0_In408465644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out408465644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:20:16,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1074244932 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1074244932 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1074244932 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1074244932 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In1074244932 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out1074244932| |P1Thread1of1ForFork1_#t~ite20_Out1074244932|) (= ~y$w_buff0_used~0_In1074244932 |P1Thread1of1ForFork1_#t~ite20_Out1074244932|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1074244932| ~y$w_buff0_used~0_In1074244932) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1074244932| |P1Thread1of1ForFork1_#t~ite20_Out1074244932|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1074244932|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1074244932, ~weak$$choice2~0=~weak$$choice2~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1074244932|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1074244932, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1074244932|, ~weak$$choice2~0=~weak$$choice2~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:20:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:20:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In30958821 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out30958821| ~y$r_buff1_thd2~0_In30958821) (= |P1Thread1of1ForFork1_#t~ite29_In30958821| |P1Thread1of1ForFork1_#t~ite29_Out30958821|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out30958821| |P1Thread1of1ForFork1_#t~ite29_Out30958821|) (= ~y$r_buff1_thd2~0_In30958821 |P1Thread1of1ForFork1_#t~ite29_Out30958821|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In30958821 256)))) (or (and (= (mod ~y$w_buff1_used~0_In30958821 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In30958821 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In30958821 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30958821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30958821, ~weak$$choice2~0=~weak$$choice2~0_In30958821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30958821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30958821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out30958821|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30958821, ~weak$$choice2~0=~weak$$choice2~0_In30958821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30958821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:20:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:20:16,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-596355054 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-596355054 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-596355054| |P1Thread1of1ForFork1_#t~ite32_Out-596355054|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-596355054 |P1Thread1of1ForFork1_#t~ite32_Out-596355054|) .cse2) (and (or .cse1 .cse0) (= ~y~0_In-596355054 |P1Thread1of1ForFork1_#t~ite32_Out-596355054|) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596355054, ~y$w_buff1~0=~y$w_buff1~0_In-596355054, ~y~0=~y~0_In-596355054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596355054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596355054, ~y$w_buff1~0=~y$w_buff1~0_In-596355054, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-596355054|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-596355054|, ~y~0=~y~0_In-596355054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596355054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:20:16,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1813257112 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1813257112 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1813257112|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1813257112 |P1Thread1of1ForFork1_#t~ite34_Out-1813257112|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1813257112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1813257112, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1813257112|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:20:16,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1631247788 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1631247788 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1631247788 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1631247788 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1631247788|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1631247788 |P1Thread1of1ForFork1_#t~ite35_Out1631247788|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631247788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631247788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631247788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631247788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631247788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631247788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631247788, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1631247788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631247788} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:20:16,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In974177362 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In974177362 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out974177362|)) (and (= ~y$r_buff0_thd2~0_In974177362 |P1Thread1of1ForFork1_#t~ite36_Out974177362|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974177362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974177362, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out974177362|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1107128676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1107128676 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1107128676 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1107128676 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1107128676|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1107128676 |P1Thread1of1ForFork1_#t~ite37_Out-1107128676|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107128676, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1107128676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-592809762 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-592809762 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-592809762 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-592809762 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-592809762| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-592809762| ~y$w_buff1_used~0_In-592809762) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-592809762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-592809762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-592809762} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-592809762|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-592809762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-592809762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-592809762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2014158314 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2014158314 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-2014158314 ~y$r_buff0_thd1~0_Out-2014158314))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-2014158314) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014158314, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2014158314} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014158314, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2014158314|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2014158314} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1418628245 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418628245 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1418628245 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418628245 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1418628245 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1418628245|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:20:16,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:20:16,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:20:16,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1128259327 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1128259327 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite40_Out1128259327| |ULTIMATE.start_main_#t~ite41_Out1128259327|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite40_Out1128259327| ~y$w_buff1~0_In1128259327) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out1128259327| ~y~0_In1128259327) (or .cse2 .cse0) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1128259327, ~y~0=~y~0_In1128259327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128259327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128259327} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1128259327|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1128259327|, ~y$w_buff1~0=~y$w_buff1~0_In1128259327, ~y~0=~y~0_In1128259327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128259327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128259327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:20:16,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1812533015 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1812533015 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1812533015| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1812533015 |ULTIMATE.start_main_#t~ite42_Out1812533015|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1812533015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1812533015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1812533015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1812533015, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1812533015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:20:16,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In899375188 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In899375188 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In899375188 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In899375188 |ULTIMATE.start_main_#t~ite43_Out899375188|)) (and (= |ULTIMATE.start_main_#t~ite43_Out899375188| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In899375188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out899375188|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In899375188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In899375188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:20:16,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In476328529 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In476328529 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out476328529|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In476328529 |ULTIMATE.start_main_#t~ite44_Out476328529|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476328529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476328529} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In476328529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476328529, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out476328529|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:20:16,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-607850233 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-607850233 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-607850233 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-607850233 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-607850233| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-607850233| ~y$r_buff1_thd0~0_In-607850233)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-607850233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-607850233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-607850233, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-607850233|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:20:16,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:16,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:20:16 BasicIcfg [2019-12-07 18:20:16,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:20:16,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:20:16,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:20:16,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:20:16,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:20:07" (3/4) ... [2019-12-07 18:20:16,689 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:20:16,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1445~0.base_35|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35|) 0) (= v_~y~0_135 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1445~0.base_35| 4)) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35|) |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0))) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35| 1)) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_17|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:16,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd1~0_Out-294244269 ~y$r_buff0_thd1~0_In-294244269) (= 1 ~y$r_buff0_thd1~0_Out-294244269) (= ~y$r_buff1_thd2~0_Out-294244269 ~y$r_buff0_thd2~0_In-294244269) (= ~x~0_Out-294244269 1) (= ~y$r_buff1_thd0~0_Out-294244269 ~y$r_buff0_thd0~0_In-294244269) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-294244269, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-294244269, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-294244269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-294244269, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-294244269, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-294244269, ~x~0=~x~0_Out-294244269, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-294244269} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:20:16,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-12-07 18:20:16,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1377282913 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1377282913 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1377282913| ~y$w_buff0_used~0_In1377282913) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1377282913|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1377282913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1377282913} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1377282913|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1377282913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1377282913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 18:20:16,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In408465644 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out408465644| ~y$w_buff0~0_In408465644) (= |P1Thread1of1ForFork1_#t~ite14_In408465644| |P1Thread1of1ForFork1_#t~ite14_Out408465644|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In408465644 256) 0))) (or (= (mod ~y$w_buff0_used~0_In408465644 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In408465644 256)) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In408465644 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite15_Out408465644| |P1Thread1of1ForFork1_#t~ite14_Out408465644|) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out408465644| ~y$w_buff0~0_In408465644)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In408465644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$w_buff0~0=~y$w_buff0~0_In408465644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In408465644, ~weak$$choice2~0=~weak$$choice2~0_In408465644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In408465644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In408465644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In408465644, ~y$w_buff0~0=~y$w_buff0~0_In408465644, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In408465644, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out408465644|, ~weak$$choice2~0=~weak$$choice2~0_In408465644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out408465644|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In408465644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 18:20:16,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1074244932 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1074244932 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1074244932 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1074244932 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In1074244932 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out1074244932| |P1Thread1of1ForFork1_#t~ite20_Out1074244932|) (= ~y$w_buff0_used~0_In1074244932 |P1Thread1of1ForFork1_#t~ite20_Out1074244932|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1074244932| ~y$w_buff0_used~0_In1074244932) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1074244932| |P1Thread1of1ForFork1_#t~ite20_Out1074244932|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1074244932|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1074244932, ~weak$$choice2~0=~weak$$choice2~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1074244932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074244932, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1074244932|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1074244932, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1074244932|, ~weak$$choice2~0=~weak$$choice2~0_In1074244932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074244932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 18:20:16,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 18:20:16,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In30958821 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out30958821| ~y$r_buff1_thd2~0_In30958821) (= |P1Thread1of1ForFork1_#t~ite29_In30958821| |P1Thread1of1ForFork1_#t~ite29_Out30958821|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out30958821| |P1Thread1of1ForFork1_#t~ite29_Out30958821|) (= ~y$r_buff1_thd2~0_In30958821 |P1Thread1of1ForFork1_#t~ite29_Out30958821|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In30958821 256)))) (or (and (= (mod ~y$w_buff1_used~0_In30958821 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In30958821 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In30958821 256)))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30958821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30958821, ~weak$$choice2~0=~weak$$choice2~0_In30958821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30958821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In30958821, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out30958821|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out30958821|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In30958821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In30958821, ~weak$$choice2~0=~weak$$choice2~0_In30958821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In30958821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:20:16,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 18:20:16,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-596355054 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-596355054 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-596355054| |P1Thread1of1ForFork1_#t~ite32_Out-596355054|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-596355054 |P1Thread1of1ForFork1_#t~ite32_Out-596355054|) .cse2) (and (or .cse1 .cse0) (= ~y~0_In-596355054 |P1Thread1of1ForFork1_#t~ite32_Out-596355054|) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596355054, ~y$w_buff1~0=~y$w_buff1~0_In-596355054, ~y~0=~y~0_In-596355054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596355054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-596355054, ~y$w_buff1~0=~y$w_buff1~0_In-596355054, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-596355054|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-596355054|, ~y~0=~y~0_In-596355054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596355054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 18:20:16,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1813257112 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1813257112 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1813257112|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1813257112 |P1Thread1of1ForFork1_#t~ite34_Out-1813257112|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1813257112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1813257112, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1813257112, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1813257112|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:20:16,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1631247788 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1631247788 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1631247788 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1631247788 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1631247788|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1631247788 |P1Thread1of1ForFork1_#t~ite35_Out1631247788|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631247788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631247788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631247788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631247788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1631247788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631247788, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1631247788, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1631247788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631247788} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:20:16,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In974177362 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In974177362 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out974177362|)) (and (= ~y$r_buff0_thd2~0_In974177362 |P1Thread1of1ForFork1_#t~ite36_Out974177362|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974177362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In974177362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In974177362, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out974177362|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:20:16,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1107128676 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1107128676 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1107128676 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1107128676 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1107128676|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1107128676 |P1Thread1of1ForFork1_#t~ite37_Out-1107128676|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107128676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1107128676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107128676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1107128676, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1107128676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107128676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:20:16,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:20:16,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-592809762 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-592809762 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-592809762 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-592809762 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-592809762| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-592809762| ~y$w_buff1_used~0_In-592809762) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-592809762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-592809762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-592809762} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-592809762|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-592809762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-592809762, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-592809762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-592809762} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 18:20:16,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2014158314 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-2014158314 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-2014158314 ~y$r_buff0_thd1~0_Out-2014158314))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-2014158314) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014158314, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2014158314} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014158314, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2014158314|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2014158314} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:20:16,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1418628245 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1418628245 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1418628245 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1418628245 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1418628245 |P0Thread1of1ForFork0_#t~ite8_Out1418628245|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1418628245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418628245, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1418628245|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1418628245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1418628245} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 18:20:16,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:20:16,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:20:16,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1128259327 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1128259327 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite40_Out1128259327| |ULTIMATE.start_main_#t~ite41_Out1128259327|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite40_Out1128259327| ~y$w_buff1~0_In1128259327) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out1128259327| ~y~0_In1128259327) (or .cse2 .cse0) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1128259327, ~y~0=~y~0_In1128259327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128259327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128259327} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1128259327|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1128259327|, ~y$w_buff1~0=~y$w_buff1~0_In1128259327, ~y~0=~y~0_In1128259327, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1128259327, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128259327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:20:16,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1812533015 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1812533015 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1812533015| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1812533015 |ULTIMATE.start_main_#t~ite42_Out1812533015|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1812533015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1812533015} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1812533015, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1812533015, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1812533015|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:20:16,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In899375188 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In899375188 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In899375188 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In899375188 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In899375188 |ULTIMATE.start_main_#t~ite43_Out899375188|)) (and (= |ULTIMATE.start_main_#t~ite43_Out899375188| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In899375188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In899375188} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In899375188, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In899375188, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out899375188|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In899375188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In899375188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:20:16,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In476328529 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In476328529 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out476328529|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In476328529 |ULTIMATE.start_main_#t~ite44_Out476328529|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476328529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476328529} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In476328529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476328529, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out476328529|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:20:16,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-607850233 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-607850233 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-607850233 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-607850233 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-607850233| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-607850233| ~y$r_buff1_thd0~0_In-607850233)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-607850233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-607850233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-607850233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-607850233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-607850233, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-607850233|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-607850233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:20:16,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:16,756 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aafd80ea-b185-4faa-81a4-b993f84ea233/bin/uautomizer/witness.graphml [2019-12-07 18:20:16,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:20:16,757 INFO L168 Benchmark]: Toolchain (without parser) took 9988.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 934.4 MB in the beginning and 997.4 MB in the end (delta: -63.0 MB). Peak memory consumption was 327.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:16,757 INFO L168 Benchmark]: CDTParser took 0.19 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 18:20:16,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:16,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.50 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 18:20:16,758 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:20:16,758 INFO L168 Benchmark]: RCFGBuilder took 375.50 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:16,759 INFO L168 Benchmark]: TraceAbstraction took 9087.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -15.6 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:16,759 INFO L168 Benchmark]: Witness Printer took 68.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 997.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:16,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.50 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.13 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 375.50 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9087.91 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 296.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -15.6 MB). Peak memory consumption was 280.6 MB. Max. memory is 11.5 GB. * Witness Printer took 68.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 997.4 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1806 SDtfs, 1876 SDslu, 4243 SDs, 0 SdLazy, 2965 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16855occurred 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: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 8741 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 48931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...