./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 30ea70b89721eac5ed4f63275a9abaeb19932fd3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-28 18:12:37,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:37,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:37,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:37,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:37,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:37,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:37,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:37,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:37,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:37,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:37,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:37,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:37,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:37,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:37,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:37,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:37,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:37,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:37,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:37,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:37,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:37,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:37,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:37,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:37,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:37,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:37,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:37,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:37,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:37,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:37,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:37,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:37,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:37,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:37,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:37,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:37,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:37,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:37,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:37,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:37,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:12:37,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:37,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:37,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:37,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:37,129 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:37,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:37,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:37,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:37,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:37,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:37,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:37,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:37,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:37,133 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:37,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:37,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:37,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:37,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:37,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:37,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:37,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:37,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:37,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:37,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:37,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:37,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:37,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:37,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:37,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:37,142 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 30ea70b89721eac5ed4f63275a9abaeb19932fd3 [2019-11-28 18:12:37,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:37,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:37,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:37,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:37,478 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:37,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i [2019-11-28 18:12:37,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea8d8e5d/e8a9a5578a734b579717fab1a11e61e6/FLAG49032da97 [2019-11-28 18:12:38,149 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:38,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i [2019-11-28 18:12:38,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea8d8e5d/e8a9a5578a734b579717fab1a11e61e6/FLAG49032da97 [2019-11-28 18:12:38,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eea8d8e5d/e8a9a5578a734b579717fab1a11e61e6 [2019-11-28 18:12:38,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:38,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:38,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:38,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:38,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:38,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:38" (1/1) ... [2019-11-28 18:12:38,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:38, skipping insertion in model container [2019-11-28 18:12:38,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:38" (1/1) ... [2019-11-28 18:12:38,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:38,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:39,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:39,047 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:39,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:39,208 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:39,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39 WrapperNode [2019-11-28 18:12:39,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:39,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:39,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:39,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:39,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:39,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:39,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:39,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:39,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... [2019-11-28 18:12:39,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:39,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:39,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:39,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:39,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:12:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:39,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:39,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:39,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:39,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:39,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:39,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:39,414 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:12:40,106 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:40,107 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:40,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:40 BoogieIcfgContainer [2019-11-28 18:12:40,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:40,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:40,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:40,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:40,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:38" (1/3) ... [2019-11-28 18:12:40,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ca4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:40, skipping insertion in model container [2019-11-28 18:12:40,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:39" (2/3) ... [2019-11-28 18:12:40,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ca4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:40, skipping insertion in model container [2019-11-28 18:12:40,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:40" (3/3) ... [2019-11-28 18:12:40,119 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc.i [2019-11-28 18:12:40,127 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:40,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:40,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:40,137 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:40,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,178 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,179 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,191 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,192 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:40,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:40,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:40,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:40,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:40,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:40,273 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:40,273 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:40,273 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:40,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:40,298 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-11-28 18:12:40,301 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:40,384 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:40,384 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:40,400 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:40,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:40,472 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:40,473 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:40,484 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:40,505 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:12:40,507 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:44,973 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 18:12:45,392 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:45,538 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:45,763 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-11-28 18:12:45,764 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-11-28 18:12:45,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-11-28 18:12:46,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-11-28 18:12:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-11-28 18:12:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:12:46,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:12:46,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-11-28 18:12:46,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729523304] [2019-11-28 18:12:46,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:46,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729523304] [2019-11-28 18:12:46,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:46,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442631834] [2019-11-28 18:12:46,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:46,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:46,640 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-11-28 18:12:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,956 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-11-28 18:12:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:46,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:12:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,096 INFO L225 Difference]: With dead ends: 8598 [2019-11-28 18:12:47,099 INFO L226 Difference]: Without dead ends: 7662 [2019-11-28 18:12:47,101 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-11-28 18:12:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-28 18:12:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-11-28 18:12:47,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-11-28 18:12:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-11-28 18:12:47,598 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-11-28 18:12:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,599 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-11-28 18:12:47,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-11-28 18:12:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:47,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:47,604 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-11-28 18:12:47,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171668876] [2019-11-28 18:12:47,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:47,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171668876] [2019-11-28 18:12:47,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:47,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480574367] [2019-11-28 18:12:47,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:47,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,718 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-11-28 18:12:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,772 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-11-28 18:12:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:47,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:12:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,782 INFO L225 Difference]: With dead ends: 1232 [2019-11-28 18:12:47,782 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 18:12:47,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 18:12:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-11-28 18:12:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-11-28 18:12:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-11-28 18:12:47,840 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-11-28 18:12:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,840 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-11-28 18:12:47,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-11-28 18:12:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:47,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:47,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-11-28 18:12:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304696133] [2019-11-28 18:12:47,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:47,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304696133] [2019-11-28 18:12:47,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:47,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570463515] [2019-11-28 18:12:47,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:47,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:47,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,986 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-11-28 18:12:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:48,085 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-11-28 18:12:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:48,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:48,101 INFO L225 Difference]: With dead ends: 1943 [2019-11-28 18:12:48,101 INFO L226 Difference]: Without dead ends: 1943 [2019-11-28 18:12:48,103 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-11-28 18:12:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-11-28 18:12:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-11-28 18:12:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-11-28 18:12:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-11-28 18:12:48,175 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-11-28 18:12:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:48,176 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-11-28 18:12:48,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-11-28 18:12:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:48,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:48,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:48,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-11-28 18:12:48,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:48,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596919573] [2019-11-28 18:12:48,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:48,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596919573] [2019-11-28 18:12:48,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:48,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:48,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767694087] [2019-11-28 18:12:48,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:48,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:48,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:48,427 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-11-28 18:12:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:48,630 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-11-28 18:12:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:48,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:48,644 INFO L225 Difference]: With dead ends: 1724 [2019-11-28 18:12:48,645 INFO L226 Difference]: Without dead ends: 1724 [2019-11-28 18:12:48,646 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-11-28 18:12:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-11-28 18:12:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-11-28 18:12:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-11-28 18:12:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-11-28 18:12:48,718 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-11-28 18:12:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:48,719 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-11-28 18:12:48,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-11-28 18:12:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:48,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:48,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:48,722 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-11-28 18:12:48,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:48,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933134013] [2019-11-28 18:12:48,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:48,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933134013] [2019-11-28 18:12:48,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:48,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:48,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467741051] [2019-11-28 18:12:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:48,826 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-11-28 18:12:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:49,021 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-11-28 18:12:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:49,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:49,035 INFO L225 Difference]: With dead ends: 1991 [2019-11-28 18:12:49,036 INFO L226 Difference]: Without dead ends: 1991 [2019-11-28 18:12:49,037 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-11-28 18:12:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-28 18:12:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-11-28 18:12:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-11-28 18:12:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-11-28 18:12:49,090 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-11-28 18:12:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:49,091 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-11-28 18:12:49,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-11-28 18:12:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:12:49,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:49,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:49,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-11-28 18:12:49,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:49,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462132001] [2019-11-28 18:12:49,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:49,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462132001] [2019-11-28 18:12:49,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:49,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:49,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600052461] [2019-11-28 18:12:49,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:49,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:49,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:49,181 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-11-28 18:12:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:49,419 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-11-28 18:12:49,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:49,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 18:12:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:49,437 INFO L225 Difference]: With dead ends: 2258 [2019-11-28 18:12:49,437 INFO L226 Difference]: Without dead ends: 2258 [2019-11-28 18:12:49,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-11-28 18:12:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-11-28 18:12:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-11-28 18:12:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-11-28 18:12:49,494 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-11-28 18:12:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:49,495 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-11-28 18:12:49,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-11-28 18:12:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:49,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:49,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:49,499 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-11-28 18:12:49,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:49,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024751770] [2019-11-28 18:12:49,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:49,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024751770] [2019-11-28 18:12:49,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:49,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:49,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438462437] [2019-11-28 18:12:49,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:49,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:49,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:49,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:49,564 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 3 states. [2019-11-28 18:12:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:49,588 INFO L93 Difference]: Finished difference Result 1931 states and 4282 transitions. [2019-11-28 18:12:49,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:49,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 18:12:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:49,595 INFO L225 Difference]: With dead ends: 1931 [2019-11-28 18:12:49,595 INFO L226 Difference]: Without dead ends: 1931 [2019-11-28 18:12:49,596 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-11-28 18:12:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2019-11-28 18:12:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1700. [2019-11-28 18:12:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-28 18:12:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 3811 transitions. [2019-11-28 18:12:49,648 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 3811 transitions. Word has length 26 [2019-11-28 18:12:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:49,649 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 3811 transitions. [2019-11-28 18:12:49,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 3811 transitions. [2019-11-28 18:12:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:49,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:49,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:49,654 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-11-28 18:12:49,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:49,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199089937] [2019-11-28 18:12:49,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199089937] [2019-11-28 18:12:49,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:49,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:49,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880009146] [2019-11-28 18:12:49,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:49,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:49,761 INFO L87 Difference]: Start difference. First operand 1700 states and 3811 transitions. Second operand 5 states. [2019-11-28 18:12:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:49,969 INFO L93 Difference]: Finished difference Result 2155 states and 4713 transitions. [2019-11-28 18:12:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:49,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:49,982 INFO L225 Difference]: With dead ends: 2155 [2019-11-28 18:12:49,982 INFO L226 Difference]: Without dead ends: 2155 [2019-11-28 18:12:49,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-11-28 18:12:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1646. [2019-11-28 18:12:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-11-28 18:12:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3700 transitions. [2019-11-28 18:12:50,026 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3700 transitions. Word has length 26 [2019-11-28 18:12:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,027 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3700 transitions. [2019-11-28 18:12:50,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3700 transitions. [2019-11-28 18:12:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:12:50,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,030 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:50,031 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:50,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash 461323697, now seen corresponding path program 1 times [2019-11-28 18:12:50,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533724847] [2019-11-28 18:12:50,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:50,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533724847] [2019-11-28 18:12:50,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:50,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:50,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811289493] [2019-11-28 18:12:50,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:50,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:50,141 INFO L87 Difference]: Start difference. First operand 1646 states and 3700 transitions. Second operand 4 states. [2019-11-28 18:12:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:50,159 INFO L93 Difference]: Finished difference Result 1645 states and 3698 transitions. [2019-11-28 18:12:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:50,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:12:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:50,166 INFO L225 Difference]: With dead ends: 1645 [2019-11-28 18:12:50,166 INFO L226 Difference]: Without dead ends: 1645 [2019-11-28 18:12:50,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2019-11-28 18:12:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2019-11-28 18:12:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2019-11-28 18:12:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3698 transitions. [2019-11-28 18:12:50,201 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3698 transitions. Word has length 27 [2019-11-28 18:12:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,202 INFO L462 AbstractCegarLoop]: Abstraction has 1645 states and 3698 transitions. [2019-11-28 18:12:50,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3698 transitions. [2019-11-28 18:12:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:12:50,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,208 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-11-28 18:12:50,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-11-28 18:12:50,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812515277] [2019-11-28 18:12:50,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:50,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812515277] [2019-11-28 18:12:50,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:50,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:50,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593579595] [2019-11-28 18:12:50,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:50,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:50,296 INFO L87 Difference]: Start difference. First operand 1645 states and 3698 transitions. Second operand 4 states. [2019-11-28 18:12:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:50,311 INFO L93 Difference]: Finished difference Result 797 states and 1775 transitions. [2019-11-28 18:12:50,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:50,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:12:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:50,314 INFO L225 Difference]: With dead ends: 797 [2019-11-28 18:12:50,314 INFO L226 Difference]: Without dead ends: 797 [2019-11-28 18:12:50,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-28 18:12:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-11-28 18:12:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-28 18:12:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1775 transitions. [2019-11-28 18:12:50,330 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1775 transitions. Word has length 28 [2019-11-28 18:12:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,330 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1775 transitions. [2019-11-28 18:12:50,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1775 transitions. [2019-11-28 18:12:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:50,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,335 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] [2019-11-28 18:12:50,335 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1237801842, now seen corresponding path program 1 times [2019-11-28 18:12:50,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82132025] [2019-11-28 18:12:50,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:50,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82132025] [2019-11-28 18:12:50,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:50,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:50,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20221955] [2019-11-28 18:12:50,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:50,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:50,429 INFO L87 Difference]: Start difference. First operand 797 states and 1775 transitions. Second operand 3 states. [2019-11-28 18:12:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:50,483 INFO L93 Difference]: Finished difference Result 1019 states and 2241 transitions. [2019-11-28 18:12:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:50,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:12:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:50,486 INFO L225 Difference]: With dead ends: 1019 [2019-11-28 18:12:50,486 INFO L226 Difference]: Without dead ends: 1019 [2019-11-28 18:12:50,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-28 18:12:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 833. [2019-11-28 18:12:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-11-28 18:12:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1860 transitions. [2019-11-28 18:12:50,505 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1860 transitions. Word has length 51 [2019-11-28 18:12:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,506 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1860 transitions. [2019-11-28 18:12:50,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1860 transitions. [2019-11-28 18:12:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:50,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,510 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-11-28 18:12:50,511 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-11-28 18:12:50,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542125216] [2019-11-28 18:12:50,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:50,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542125216] [2019-11-28 18:12:50,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:50,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:50,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43837890] [2019-11-28 18:12:50,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:50,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:50,674 INFO L87 Difference]: Start difference. First operand 833 states and 1860 transitions. Second operand 7 states. [2019-11-28 18:12:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:50,941 INFO L93 Difference]: Finished difference Result 2530 states and 5545 transitions. [2019-11-28 18:12:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:50,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:12:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:50,946 INFO L225 Difference]: With dead ends: 2530 [2019-11-28 18:12:50,947 INFO L226 Difference]: Without dead ends: 1756 [2019-11-28 18:12:50,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-11-28 18:12:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-11-28 18:12:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 953. [2019-11-28 18:12:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-28 18:12:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2118 transitions. [2019-11-28 18:12:50,974 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2118 transitions. Word has length 52 [2019-11-28 18:12:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:50,974 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2118 transitions. [2019-11-28 18:12:50,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2118 transitions. [2019-11-28 18:12:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:50,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:50,977 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-11-28 18:12:50,978 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:50,978 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-11-28 18:12:50,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:50,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579659502] [2019-11-28 18:12:50,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:51,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:51,112 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:51,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t909~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t909~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35|) |v_ULTIMATE.start_main_~#t909~0.offset_24| 0)) |v_#memory_int_15|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t909~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_~#t909~0.offset=|v_ULTIMATE.start_main_~#t909~0.offset_24|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t909~0.base=|v_ULTIMATE.start_main_~#t909~0.base_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t909~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t909~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t910~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:51,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13|) |v_ULTIMATE.start_main_~#t910~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t910~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13| 1) |v_#valid_29|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t910~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t910~0.offset_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t910~0.base_13| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_~#t910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:51,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782)) (= 1 ~z$w_buff0_used~0_Out597800782) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out597800782 256))) (not (= (mod ~z$w_buff0_used~0_Out597800782 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782|) (= ~z$w_buff1_used~0_Out597800782 ~z$w_buff0_used~0_In597800782) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782) (= P0Thread1of1ForFork0_~arg.base_Out597800782 |P0Thread1of1ForFork0_#in~arg.base_In597800782|) (= ~z$w_buff1~0_Out597800782 ~z$w_buff0~0_In597800782) (= ~z$w_buff0~0_Out597800782 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In597800782| P0Thread1of1ForFork0_~arg.offset_Out597800782)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In597800782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597800782, ~z$w_buff0~0=~z$w_buff0~0_In597800782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In597800782|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In597800782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out597800782, ~z$w_buff0~0=~z$w_buff0~0_Out597800782, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out597800782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In597800782|, ~z$w_buff1~0=~z$w_buff1~0_Out597800782, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out597800782, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out597800782} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:51,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1570503531 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In1570503531 256) 0) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In1570503531 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1570503531 256)))) .cse1 (= ~z$w_buff1_used~0_In1570503531 |P1Thread1of1ForFork1_#t~ite23_Out1570503531|) (= |P1Thread1of1ForFork1_#t~ite24_Out1570503531| |P1Thread1of1ForFork1_#t~ite23_Out1570503531|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In1570503531| |P1Thread1of1ForFork1_#t~ite23_Out1570503531|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out1570503531| ~z$w_buff1_used~0_In1570503531)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1570503531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1570503531|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:51,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:51,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:51,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1712978252 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1712978252 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1712978252| ~z$w_buff0_used~0_In1712978252)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1712978252| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1712978252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1712978252} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1712978252|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1712978252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1712978252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:51,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2120013689 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-2120013689 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2120013689 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2120013689 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2120013689| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120013689| ~z$w_buff1_used~0_In-2120013689)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120013689, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2120013689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120013689, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2120013689} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2120013689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120013689, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2120013689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120013689, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2120013689} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:51,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2019514602 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2019514602 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-2019514602 ~z$r_buff0_thd1~0_In-2019514602))) (or (and (= ~z$r_buff0_thd1~0_Out-2019514602 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019514602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2019514602} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019514602, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2019514602|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2019514602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:51,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1138839504 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1138839504 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1138839504 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1138839504 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1138839504| ~z$r_buff1_thd1~0_In-1138839504) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1138839504| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138839504, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138839504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138839504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138839504} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138839504, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1138839504|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138839504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138839504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138839504} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:51,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-469803081 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-469803081 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-469803081| |P1Thread1of1ForFork1_#t~ite33_Out-469803081|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-469803081 |P1Thread1of1ForFork1_#t~ite32_Out-469803081|)) (and (not .cse1) (not .cse0) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-469803081| ~z$w_buff1~0_In-469803081)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-469803081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-469803081, ~z$w_buff1~0=~z$w_buff1~0_In-469803081, ~z~0=~z~0_In-469803081} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-469803081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-469803081, ~z$w_buff1~0=~z$w_buff1~0_In-469803081, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-469803081|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-469803081|, ~z~0=~z~0_In-469803081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:51,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1619958721 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1619958721 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1619958721|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1619958721 |P1Thread1of1ForFork1_#t~ite34_Out-1619958721|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619958721, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1619958721} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619958721, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1619958721|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1619958721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:51,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In817479783 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In817479783 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In817479783 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In817479783 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| ~z$w_buff1_used~0_In817479783)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817479783, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817479783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817479783, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817479783} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In817479783, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817479783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817479783, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out817479783|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817479783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:51,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2086063597 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2086063597 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2086063597 |P1Thread1of1ForFork1_#t~ite36_Out2086063597|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out2086063597|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2086063597, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2086063597} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2086063597, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2086063597, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2086063597|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:51,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In344923534 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In344923534 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In344923534 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In344923534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In344923534 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In344923534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In344923534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344923534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In344923534} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In344923534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In344923534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344923534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In344923534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out344923534|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:51,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:51,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:51,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:51,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2146966236 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2146966236 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2146966236| ~z~0_In2146966236) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2146966236| ~z$w_buff1~0_In2146966236)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146966236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146966236, ~z$w_buff1~0=~z$w_buff1~0_In2146966236, ~z~0=~z~0_In2146966236} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2146966236|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146966236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146966236, ~z$w_buff1~0=~z$w_buff1~0_In2146966236, ~z~0=~z~0_In2146966236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:51,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:51,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1917796579 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1917796579 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1917796579| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1917796579 |ULTIMATE.start_main_#t~ite42_Out-1917796579|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1917796579, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1917796579} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1917796579, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1917796579, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1917796579|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:51,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In760269569 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In760269569 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In760269569 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In760269569 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In760269569 |ULTIMATE.start_main_#t~ite43_Out760269569|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out760269569|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In760269569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In760269569, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In760269569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760269569} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In760269569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In760269569, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In760269569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760269569, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out760269569|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:51,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1403330770 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1403330770 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1403330770| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1403330770 |ULTIMATE.start_main_#t~ite44_Out1403330770|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1403330770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1403330770} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1403330770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1403330770, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1403330770|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:51,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1478647122 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1478647122 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1478647122 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1478647122 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1478647122 |ULTIMATE.start_main_#t~ite45_Out1478647122|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1478647122|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1478647122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478647122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1478647122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478647122} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1478647122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478647122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1478647122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478647122, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1478647122|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:51,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:51,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:51 BasicIcfg [2019-11-28 18:12:51,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:51,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:51,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:51,213 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:51,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:40" (3/4) ... [2019-11-28 18:12:51,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:51,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t909~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 v_~z$flush_delayed~0_37) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= |v_ULTIMATE.start_main_~#t909~0.offset_24| 0) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_35|) |v_ULTIMATE.start_main_~#t909~0.offset_24| 0)) |v_#memory_int_15|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t909~0.base_35|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t909~0.base_35| 4)) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_~#t909~0.offset=|v_ULTIMATE.start_main_~#t909~0.offset_24|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start_main_~#t909~0.base=|v_ULTIMATE.start_main_~#t909~0.base_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t909~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t909~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t910~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:51,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13|) |v_ULTIMATE.start_main_~#t910~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t910~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13| 1) |v_#valid_29|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t910~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t910~0.offset_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t910~0.base_13| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_~#t910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:51,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782)) (= 1 ~z$w_buff0_used~0_Out597800782) (= (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out597800782 256))) (not (= (mod ~z$w_buff0_used~0_Out597800782 256) 0)))) 1 0) |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782|) (= ~z$w_buff1_used~0_Out597800782 ~z$w_buff0_used~0_In597800782) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782) (= P0Thread1of1ForFork0_~arg.base_Out597800782 |P0Thread1of1ForFork0_#in~arg.base_In597800782|) (= ~z$w_buff1~0_Out597800782 ~z$w_buff0~0_In597800782) (= ~z$w_buff0~0_Out597800782 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In597800782| P0Thread1of1ForFork0_~arg.offset_Out597800782)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In597800782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In597800782, ~z$w_buff0~0=~z$w_buff0~0_In597800782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In597800782|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In597800782|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out597800782, ~z$w_buff0~0=~z$w_buff0~0_Out597800782, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out597800782, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out597800782, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In597800782|, ~z$w_buff1~0=~z$w_buff1~0_Out597800782, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out597800782, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out597800782|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out597800782} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:51,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1570503531 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In1570503531 256) 0) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In1570503531 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1570503531 256)))) .cse1 (= ~z$w_buff1_used~0_In1570503531 |P1Thread1of1ForFork1_#t~ite23_Out1570503531|) (= |P1Thread1of1ForFork1_#t~ite24_Out1570503531| |P1Thread1of1ForFork1_#t~ite23_Out1570503531|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In1570503531| |P1Thread1of1ForFork1_#t~ite23_Out1570503531|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite24_Out1570503531| ~z$w_buff1_used~0_In1570503531)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570503531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1570503531} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1570503531, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1570503531|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:51,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:51,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:51,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1712978252 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1712978252 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1712978252| ~z$w_buff0_used~0_In1712978252)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1712978252| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1712978252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1712978252} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1712978252|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1712978252, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1712978252} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:51,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-2120013689 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-2120013689 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2120013689 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2120013689 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-2120013689| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-2120013689| ~z$w_buff1_used~0_In-2120013689)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120013689, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2120013689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120013689, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2120013689} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2120013689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2120013689, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2120013689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2120013689, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2120013689} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:51,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-2019514602 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2019514602 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-2019514602 ~z$r_buff0_thd1~0_In-2019514602))) (or (and (= ~z$r_buff0_thd1~0_Out-2019514602 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019514602, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2019514602} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2019514602, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2019514602|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2019514602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:51,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1138839504 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1138839504 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1138839504 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1138839504 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1138839504| ~z$r_buff1_thd1~0_In-1138839504) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1138839504| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138839504, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138839504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138839504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138839504} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1138839504, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1138839504|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1138839504, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1138839504, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1138839504} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:51,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-469803081 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-469803081 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-469803081| |P1Thread1of1ForFork1_#t~ite33_Out-469803081|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-469803081 |P1Thread1of1ForFork1_#t~ite32_Out-469803081|)) (and (not .cse1) (not .cse0) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-469803081| ~z$w_buff1~0_In-469803081)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-469803081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-469803081, ~z$w_buff1~0=~z$w_buff1~0_In-469803081, ~z~0=~z~0_In-469803081} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-469803081, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-469803081, ~z$w_buff1~0=~z$w_buff1~0_In-469803081, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-469803081|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-469803081|, ~z~0=~z~0_In-469803081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:51,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1619958721 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1619958721 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1619958721|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1619958721 |P1Thread1of1ForFork1_#t~ite34_Out-1619958721|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619958721, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1619958721} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1619958721, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1619958721|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1619958721} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:51,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In817479783 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In817479783 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In817479783 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In817479783 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| ~z$w_buff1_used~0_In817479783)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817479783, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817479783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817479783, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817479783} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In817479783, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In817479783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817479783, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out817479783|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In817479783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:51,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2086063597 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2086063597 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In2086063597 |P1Thread1of1ForFork1_#t~ite36_Out2086063597|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out2086063597|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2086063597, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2086063597} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2086063597, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2086063597, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2086063597|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:51,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In344923534 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In344923534 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In344923534 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In344923534 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In344923534 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In344923534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In344923534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344923534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In344923534} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In344923534, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In344923534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344923534, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In344923534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out344923534|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:51,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:51,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:51,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:51,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2146966236 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2146966236 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2146966236| ~z~0_In2146966236) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2146966236| ~z$w_buff1~0_In2146966236)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146966236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146966236, ~z$w_buff1~0=~z$w_buff1~0_In2146966236, ~z~0=~z~0_In2146966236} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2146966236|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146966236, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146966236, ~z$w_buff1~0=~z$w_buff1~0_In2146966236, ~z~0=~z~0_In2146966236} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:51,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:51,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1917796579 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1917796579 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1917796579| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1917796579 |ULTIMATE.start_main_#t~ite42_Out-1917796579|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1917796579, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1917796579} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1917796579, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1917796579, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1917796579|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:51,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In760269569 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In760269569 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In760269569 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In760269569 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In760269569 |ULTIMATE.start_main_#t~ite43_Out760269569|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out760269569|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In760269569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In760269569, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In760269569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760269569} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In760269569, ~z$w_buff0_used~0=~z$w_buff0_used~0_In760269569, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In760269569, ~z$w_buff1_used~0=~z$w_buff1_used~0_In760269569, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out760269569|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:51,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1403330770 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1403330770 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1403330770| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1403330770 |ULTIMATE.start_main_#t~ite44_Out1403330770|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1403330770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1403330770} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1403330770, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1403330770, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1403330770|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:51,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1478647122 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1478647122 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1478647122 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1478647122 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1478647122 |ULTIMATE.start_main_#t~ite45_Out1478647122|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1478647122|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1478647122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478647122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1478647122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478647122} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1478647122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1478647122, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1478647122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478647122, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1478647122|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:51,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:51,340 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:51,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:51,343 INFO L168 Benchmark]: Toolchain (without parser) took 12938.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 955.0 MB in the beginning and 834.9 MB in the end (delta: 120.1 MB). Peak memory consumption was 467.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,343 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:51,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,345 INFO L168 Benchmark]: Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:51,346 INFO L168 Benchmark]: RCFGBuilder took 771.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,346 INFO L168 Benchmark]: TraceAbstraction took 11102.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 214.9 MB). Peak memory consumption was 411.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,347 INFO L168 Benchmark]: Witness Printer took 128.09 ms. Allocated memory is still 1.4 GB. Free memory was 854.1 MB in the beginning and 834.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:51,350 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.93 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 803.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 771.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11102.95 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.6 MB). Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 214.9 MB). Peak memory consumption was 411.5 MB. Max. memory is 11.5 GB. * Witness Printer took 128.09 ms. Allocated memory is still 1.4 GB. Free memory was 854.1 MB in the beginning and 834.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1423 SDtfs, 992 SDslu, 2548 SDs, 0 SdLazy, 915 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2887 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 28296 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...