./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi001_pso.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/rfi001_pso.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 1dbde380403f7bd83bc1a9b7ee17b5975367fb64 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:47,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:21:47,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:21:47,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:21:47,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:21:47,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:21:47,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:21:47,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:21:47,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:21:47,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:21:47,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:21:47,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:21:47,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:21:47,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:21:47,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:21:47,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:21:47,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:21:47,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:21:47,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:21:47,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:21:47,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:21:47,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:21:47,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:21:47,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:21:47,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:21:47,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:21:47,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:21:47,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:21:47,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:21:47,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:21:47,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:21:47,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:21:47,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:21:47,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:21:47,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:21:47,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:21:47,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:21:47,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:21:47,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:21:47,222 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:21:47,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:21:47,224 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:21:47,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:21:47,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:21:47,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:21:47,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:21:47,245 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:21:47,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:21:47,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:21:47,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:21:47,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:21:47,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:21:47,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:21:47,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:21:47,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:21:47,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:21:47,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:21:47,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:21:47,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:21:47,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:21:47,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:21:47,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:21:47,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:21:47,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:21:47,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:21:47,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:21:47,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:21:47,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:21:47,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:21:47,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:21:47,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:21:47,252 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 -> 1dbde380403f7bd83bc1a9b7ee17b5975367fb64 [2019-11-28 18:21:47,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:21:47,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:21:47,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:21:47,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:21:47,625 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:21:47,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc.i [2019-11-28 18:21:47,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2492c2aea/d3d9fccccb044eebbdc553aeb1ad5772/FLAG87bdf00a2 [2019-11-28 18:21:48,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:21:48,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc.i [2019-11-28 18:21:48,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2492c2aea/d3d9fccccb044eebbdc553aeb1ad5772/FLAG87bdf00a2 [2019-11-28 18:21:48,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2492c2aea/d3d9fccccb044eebbdc553aeb1ad5772 [2019-11-28 18:21:48,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:21:48,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:21:48,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:48,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:21:48,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:21:48,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:48" (1/1) ... [2019-11-28 18:21:48,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27932562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:48, skipping insertion in model container [2019-11-28 18:21:48,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:48" (1/1) ... [2019-11-28 18:21:48,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:21:48,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:21:49,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:49,191 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:21:49,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:21:49,372 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:21:49,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49 WrapperNode [2019-11-28 18:21:49,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:21:49,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:49,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:21:49,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:21:49,383 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:21:49" (1/1) ... [2019-11-28 18:21:49,410 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:21:49" (1/1) ... [2019-11-28 18:21:49,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:21:49,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:21:49,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:21:49,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:21:49,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (1/1) ... [2019-11-28 18:21:49,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:21:49,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:21:49,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:21:49,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:21:49,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (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:21:49,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:21:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:21:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:21:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:21:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:21:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:21:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:21:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:21:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:21:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:21:49,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:21:49,566 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:21:50,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:21:50,232 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:21:50,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:50 BoogieIcfgContainer [2019-11-28 18:21:50,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:21:50,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:21:50,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:21:50,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:21:50,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:21:48" (1/3) ... [2019-11-28 18:21:50,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d937674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:50, skipping insertion in model container [2019-11-28 18:21:50,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:49" (2/3) ... [2019-11-28 18:21:50,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d937674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:50, skipping insertion in model container [2019-11-28 18:21:50,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:50" (3/3) ... [2019-11-28 18:21:50,243 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc.i [2019-11-28 18:21:50,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:21:50,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:21:50,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:21:50,265 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:21:50,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:21:50,376 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:21:50,399 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:21:50,399 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:21:50,399 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:21:50,400 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:21:50,400 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:21:50,400 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:21:50,400 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:21:50,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:21:50,418 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:21:50,421 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:21:50,522 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:21:50,522 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:50,544 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:21:50,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:21:50,658 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:21:50,659 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:21:50,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 575 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:21:50,693 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:21:50,695 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:21:55,145 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:21:55,264 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:21:55,799 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-11-28 18:21:55,799 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:21:55,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-11-28 18:21:56,439 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:21:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:21:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:21:56,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:56,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:21:56,454 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:21:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-11-28 18:21:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:56,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923387618] [2019-11-28 18:21:56,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:56,818 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:21:56,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923387618] [2019-11-28 18:21:56,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:56,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:21:56,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745305909] [2019-11-28 18:21:56,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:56,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:56,862 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:21:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:57,172 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-11-28 18:21:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:57,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:21:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:57,279 INFO L225 Difference]: With dead ends: 8506 [2019-11-28 18:21:57,286 INFO L226 Difference]: Without dead ends: 7522 [2019-11-28 18:21:57,287 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:21:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-11-28 18:21:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-11-28 18:21:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-11-28 18:21:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-11-28 18:21:57,709 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-11-28 18:21:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:57,710 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-11-28 18:21:57,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-11-28 18:21:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:57,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:57,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:57,714 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:21:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-11-28 18:21:57,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:57,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892228091] [2019-11-28 18:21:57,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:57,806 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:21:57,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892228091] [2019-11-28 18:21:57,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:57,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:57,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631550262] [2019-11-28 18:21:57,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:57,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:57,812 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-11-28 18:21:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:58,210 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-11-28 18:21:58,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:58,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:21:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:58,292 INFO L225 Difference]: With dead ends: 11740 [2019-11-28 18:21:58,293 INFO L226 Difference]: Without dead ends: 11726 [2019-11-28 18:21:58,294 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:21:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-11-28 18:21:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-11-28 18:21:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-11-28 18:21:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-11-28 18:21:58,883 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-11-28 18:21:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:58,884 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-11-28 18:21:58,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-11-28 18:21:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:21:58,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:58,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:58,894 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:21:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-11-28 18:21:58,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:58,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906289552] [2019-11-28 18:21:58,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:58,966 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:21:58,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906289552] [2019-11-28 18:21:58,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:58,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:58,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987987296] [2019-11-28 18:21:58,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:58,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:58,975 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-11-28 18:21:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:59,145 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-11-28 18:21:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:59,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:21:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:59,208 INFO L225 Difference]: With dead ends: 15866 [2019-11-28 18:21:59,209 INFO L226 Difference]: Without dead ends: 15866 [2019-11-28 18:21:59,209 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:21:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-11-28 18:21:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-11-28 18:21:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-11-28 18:21:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-11-28 18:21:59,642 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-11-28 18:21:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:59,643 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-11-28 18:21:59,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-11-28 18:21:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:21:59,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:59,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:59,648 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:21:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:59,648 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-11-28 18:21:59,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:59,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66070766] [2019-11-28 18:21:59,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:59,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66070766] [2019-11-28 18:21:59,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:59,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:59,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930438004] [2019-11-28 18:21:59,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:59,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:59,763 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-11-28 18:22:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:00,011 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-11-28 18:22:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:00,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:00,068 INFO L225 Difference]: With dead ends: 14131 [2019-11-28 18:22:00,068 INFO L226 Difference]: Without dead ends: 14131 [2019-11-28 18:22:00,069 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:22:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-11-28 18:22:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-11-28 18:22:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-11-28 18:22:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-11-28 18:22:00,727 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-11-28 18:22:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:00,728 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-11-28 18:22:00,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-11-28 18:22:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:00,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:00,731 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:00,732 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:22:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-11-28 18:22:00,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:00,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181840429] [2019-11-28 18:22:00,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:00,819 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:22:00,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181840429] [2019-11-28 18:22:00,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:00,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:00,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471575932] [2019-11-28 18:22:00,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:00,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:00,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:00,821 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-11-28 18:22:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:01,083 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-11-28 18:22:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:01,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:01,121 INFO L225 Difference]: With dead ends: 15545 [2019-11-28 18:22:01,121 INFO L226 Difference]: Without dead ends: 15545 [2019-11-28 18:22:01,122 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:22:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-11-28 18:22:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-11-28 18:22:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-11-28 18:22:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-11-28 18:22:01,502 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-11-28 18:22:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:01,502 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-11-28 18:22:01,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-11-28 18:22:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:01,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:01,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:01,508 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:22:01,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash 929928555, now seen corresponding path program 1 times [2019-11-28 18:22:01,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:01,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453338303] [2019-11-28 18:22:01,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:01,572 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:22:01,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453338303] [2019-11-28 18:22:01,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:01,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:01,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028105314] [2019-11-28 18:22:01,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:01,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:01,574 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-11-28 18:22:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:01,652 INFO L93 Difference]: Finished difference Result 13090 states and 40732 transitions. [2019-11-28 18:22:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:01,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:01,678 INFO L225 Difference]: With dead ends: 13090 [2019-11-28 18:22:01,679 INFO L226 Difference]: Without dead ends: 13090 [2019-11-28 18:22:01,679 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:22:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2019-11-28 18:22:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13010. [2019-11-28 18:22:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13010 states. [2019-11-28 18:22:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 40500 transitions. [2019-11-28 18:22:02,054 INFO L78 Accepts]: Start accepts. Automaton has 13010 states and 40500 transitions. Word has length 16 [2019-11-28 18:22:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:02,054 INFO L462 AbstractCegarLoop]: Abstraction has 13010 states and 40500 transitions. [2019-11-28 18:22:02,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13010 states and 40500 transitions. [2019-11-28 18:22:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:02,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:02,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:02,061 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:22:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1402616714, now seen corresponding path program 1 times [2019-11-28 18:22:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:02,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160142128] [2019-11-28 18:22:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:02,154 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:22:02,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160142128] [2019-11-28 18:22:02,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:02,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:02,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864536247] [2019-11-28 18:22:02,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:02,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:02,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:02,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:02,160 INFO L87 Difference]: Start difference. First operand 13010 states and 40500 transitions. Second operand 3 states. [2019-11-28 18:22:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:02,285 INFO L93 Difference]: Finished difference Result 22298 states and 68842 transitions. [2019-11-28 18:22:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:02,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:02,327 INFO L225 Difference]: With dead ends: 22298 [2019-11-28 18:22:02,327 INFO L226 Difference]: Without dead ends: 19870 [2019-11-28 18:22:02,328 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:22:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19870 states. [2019-11-28 18:22:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19870 to 18980. [2019-11-28 18:22:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-11-28 18:22:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 59240 transitions. [2019-11-28 18:22:03,091 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 59240 transitions. Word has length 16 [2019-11-28 18:22:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:03,092 INFO L462 AbstractCegarLoop]: Abstraction has 18980 states and 59240 transitions. [2019-11-28 18:22:03,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 59240 transitions. [2019-11-28 18:22:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:03,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:03,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:03,100 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:22:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 570123844, now seen corresponding path program 1 times [2019-11-28 18:22:03,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:03,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068846178] [2019-11-28 18:22:03,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:03,139 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:22:03,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068846178] [2019-11-28 18:22:03,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:03,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:03,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904561991] [2019-11-28 18:22:03,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:03,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:03,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:03,142 INFO L87 Difference]: Start difference. First operand 18980 states and 59240 transitions. Second operand 3 states. [2019-11-28 18:22:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:03,159 INFO L93 Difference]: Finished difference Result 2388 states and 5347 transitions. [2019-11-28 18:22:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:03,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:22:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:03,164 INFO L225 Difference]: With dead ends: 2388 [2019-11-28 18:22:03,164 INFO L226 Difference]: Without dead ends: 2388 [2019-11-28 18:22:03,165 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:22:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-11-28 18:22:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-11-28 18:22:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-28 18:22:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5347 transitions. [2019-11-28 18:22:03,205 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5347 transitions. Word has length 17 [2019-11-28 18:22:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:03,206 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5347 transitions. [2019-11-28 18:22:03,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5347 transitions. [2019-11-28 18:22:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:22:03,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:03,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:03,211 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:22:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-11-28 18:22:03,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:03,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628765961] [2019-11-28 18:22:03,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:03,282 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:22:03,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628765961] [2019-11-28 18:22:03,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:03,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:03,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235342252] [2019-11-28 18:22:03,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:03,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:03,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:03,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:03,286 INFO L87 Difference]: Start difference. First operand 2388 states and 5347 transitions. Second operand 5 states. [2019-11-28 18:22:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:03,506 INFO L93 Difference]: Finished difference Result 2913 states and 6370 transitions. [2019-11-28 18:22:03,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:03,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 18:22:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:03,510 INFO L225 Difference]: With dead ends: 2913 [2019-11-28 18:22:03,511 INFO L226 Difference]: Without dead ends: 2913 [2019-11-28 18:22:03,511 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:22:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-28 18:22:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2438. [2019-11-28 18:22:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-11-28 18:22:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 5449 transitions. [2019-11-28 18:22:03,540 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 5449 transitions. Word has length 25 [2019-11-28 18:22:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:03,540 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 5449 transitions. [2019-11-28 18:22:03,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 5449 transitions. [2019-11-28 18:22:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:22:03,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:03,544 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:03,544 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:22:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:03,545 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-11-28 18:22:03,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:03,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500059836] [2019-11-28 18:22:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:03,588 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:22:03,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500059836] [2019-11-28 18:22:03,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:03,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:03,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614625203] [2019-11-28 18:22:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:03,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:03,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:03,591 INFO L87 Difference]: Start difference. First operand 2438 states and 5449 transitions. Second operand 3 states. [2019-11-28 18:22:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:03,635 INFO L93 Difference]: Finished difference Result 3081 states and 6522 transitions. [2019-11-28 18:22:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:03,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 18:22:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:03,641 INFO L225 Difference]: With dead ends: 3081 [2019-11-28 18:22:03,641 INFO L226 Difference]: Without dead ends: 3081 [2019-11-28 18:22:03,642 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:22:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-11-28 18:22:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2429. [2019-11-28 18:22:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-11-28 18:22:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 5197 transitions. [2019-11-28 18:22:03,682 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 5197 transitions. Word has length 25 [2019-11-28 18:22:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:03,684 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 5197 transitions. [2019-11-28 18:22:03,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 5197 transitions. [2019-11-28 18:22:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:03,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:03,689 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:22:03,689 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:22:03,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-11-28 18:22:03,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:03,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617607637] [2019-11-28 18:22:03,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:03,760 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:22:03,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617607637] [2019-11-28 18:22:03,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:03,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:03,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046277905] [2019-11-28 18:22:03,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:03,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:03,763 INFO L87 Difference]: Start difference. First operand 2429 states and 5197 transitions. Second operand 5 states. [2019-11-28 18:22:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:03,996 INFO L93 Difference]: Finished difference Result 2847 states and 6006 transitions. [2019-11-28 18:22:03,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:03,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:04,001 INFO L225 Difference]: With dead ends: 2847 [2019-11-28 18:22:04,001 INFO L226 Difference]: Without dead ends: 2847 [2019-11-28 18:22:04,002 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:22:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2019-11-28 18:22:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2388. [2019-11-28 18:22:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-28 18:22:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5113 transitions. [2019-11-28 18:22:04,039 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5113 transitions. Word has length 26 [2019-11-28 18:22:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:04,040 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5113 transitions. [2019-11-28 18:22:04,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5113 transitions. [2019-11-28 18:22:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:22:04,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:04,044 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:22:04,044 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:22:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1516082769, now seen corresponding path program 1 times [2019-11-28 18:22:04,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:04,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865059149] [2019-11-28 18:22:04,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:04,120 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:22:04,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865059149] [2019-11-28 18:22:04,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:04,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:04,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806522953] [2019-11-28 18:22:04,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:04,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:04,122 INFO L87 Difference]: Start difference. First operand 2388 states and 5113 transitions. Second operand 4 states. [2019-11-28 18:22:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:04,139 INFO L93 Difference]: Finished difference Result 1174 states and 2488 transitions. [2019-11-28 18:22:04,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:04,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:22:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:04,141 INFO L225 Difference]: With dead ends: 1174 [2019-11-28 18:22:04,141 INFO L226 Difference]: Without dead ends: 1142 [2019-11-28 18:22:04,142 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:22:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-28 18:22:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 795. [2019-11-28 18:22:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-28 18:22:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1666 transitions. [2019-11-28 18:22:04,155 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1666 transitions. Word has length 28 [2019-11-28 18:22:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:04,156 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1666 transitions. [2019-11-28 18:22:04,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1666 transitions. [2019-11-28 18:22:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:22:04,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:04,161 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:22:04,161 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:22:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1729344618, now seen corresponding path program 1 times [2019-11-28 18:22:04,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:04,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037658401] [2019-11-28 18:22:04,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:04,307 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:22:04,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037658401] [2019-11-28 18:22:04,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531589067] [2019-11-28 18:22:04,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:04,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:04,312 INFO L87 Difference]: Start difference. First operand 795 states and 1666 transitions. Second operand 3 states. [2019-11-28 18:22:04,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:04,360 INFO L93 Difference]: Finished difference Result 988 states and 2066 transitions. [2019-11-28 18:22:04,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:04,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:22:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:04,364 INFO L225 Difference]: With dead ends: 988 [2019-11-28 18:22:04,364 INFO L226 Difference]: Without dead ends: 988 [2019-11-28 18:22:04,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-11-28 18:22:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 772. [2019-11-28 18:22:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-11-28 18:22:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1632 transitions. [2019-11-28 18:22:04,378 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1632 transitions. Word has length 52 [2019-11-28 18:22:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:04,378 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1632 transitions. [2019-11-28 18:22:04,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1632 transitions. [2019-11-28 18:22:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:22:04,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:04,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:04,382 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -486023076, now seen corresponding path program 1 times [2019-11-28 18:22:04,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:04,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233942021] [2019-11-28 18:22:04,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:04,640 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:22:04,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233942021] [2019-11-28 18:22:04,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:04,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:04,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53740692] [2019-11-28 18:22:04,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:22:04,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:04,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:22:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:04,644 INFO L87 Difference]: Start difference. First operand 772 states and 1632 transitions. Second operand 7 states. [2019-11-28 18:22:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:05,121 INFO L93 Difference]: Finished difference Result 3163 states and 6585 transitions. [2019-11-28 18:22:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:22:05,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:22:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:05,125 INFO L225 Difference]: With dead ends: 3163 [2019-11-28 18:22:05,126 INFO L226 Difference]: Without dead ends: 2147 [2019-11-28 18:22:05,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:22:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-11-28 18:22:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 894. [2019-11-28 18:22:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-11-28 18:22:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1873 transitions. [2019-11-28 18:22:05,147 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1873 transitions. Word has length 53 [2019-11-28 18:22:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:05,147 INFO L462 AbstractCegarLoop]: Abstraction has 894 states and 1873 transitions. [2019-11-28 18:22:05,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:22:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1873 transitions. [2019-11-28 18:22:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:22:05,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:05,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:05,150 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 2 times [2019-11-28 18:22:05,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:05,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791039051] [2019-11-28 18:22:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:05,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:05,316 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:05,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31|) |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31|)) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1605~0.base_31| 4)) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1605~0.base_31|) (= 0 v_~x$r_buff0_thd2~0_279) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31| 1)) (= 0 v_~x~0_116) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_~#t1605~0.base=|v_ULTIMATE.start_main_~#t1605~0.base_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1605~0.offset=|v_ULTIMATE.start_main_~#t1605~0.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ~y~0=v_~y~0_95, ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1605~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1605~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1606~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1606~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:05,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~y~0_Out1239339556 1) (= ~x$r_buff0_thd1~0_In1239339556 ~x$r_buff1_thd1~0_Out1239339556) (= ~x$r_buff1_thd2~0_Out1239339556 ~x$r_buff0_thd2~0_In1239339556) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556)) (= ~x$r_buff1_thd0~0_Out1239339556 ~x$r_buff0_thd0~0_In1239339556) (= 1 ~x$r_buff0_thd1~0_Out1239339556)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239339556, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1239339556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1239339556} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239339556, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1239339556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1239339556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1239339556, ~y~0=~y~0_Out1239339556, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1239339556, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1239339556} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:05,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t1606~0.offset_10| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11|) |v_ULTIMATE.start_main_~#t1606~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1606~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1606~0.base_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1606~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1606~0.offset, ULTIMATE.start_main_~#t1606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:22:05,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In905195788 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In905195788 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out905195788| ~x$w_buff0_used~0_In905195788)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out905195788| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In905195788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905195788} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out905195788|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In905195788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905195788} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:22:05,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-1649332172 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1649332172 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1649332172 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1649332172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1649332172| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1649332172| ~x$w_buff1_used~0_In-1649332172) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649332172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649332172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649332172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649332172} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1649332172|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649332172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649332172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649332172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649332172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:22:05,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In422075889 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In422075889 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out422075889 ~x$r_buff0_thd1~0_In422075889))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out422075889)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In422075889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In422075889} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out422075889, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out422075889|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In422075889} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:22:05,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1077444158 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1077444158 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1077444158 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1077444158 256)))) (or (and (= ~x$r_buff1_thd1~0_In1077444158 |P0Thread1of1ForFork0_#t~ite8_Out1077444158|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1077444158|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1077444158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1077444158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1077444158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1077444158} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1077444158, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1077444158|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1077444158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1077444158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1077444158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:22:05,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:22:05,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:22:05,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1654057460 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1654057460 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1654057460 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1654057460 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1654057460 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out1654057460| |P1Thread1of1ForFork1_#t~ite29_Out1654057460|) (= ~x$r_buff1_thd2~0_In1654057460 |P1Thread1of1ForFork1_#t~ite29_Out1654057460|)) (and (not .cse1) (= ~x$r_buff1_thd2~0_In1654057460 |P1Thread1of1ForFork1_#t~ite30_Out1654057460|) (= |P1Thread1of1ForFork1_#t~ite29_In1654057460| |P1Thread1of1ForFork1_#t~ite29_Out1654057460|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1654057460|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654057460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1654057460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654057460, ~weak$$choice2~0=~weak$$choice2~0_In1654057460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654057460} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1654057460|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1654057460|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654057460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1654057460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654057460, ~weak$$choice2~0=~weak$$choice2~0_In1654057460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654057460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:22:05,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:22:05,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In499048575 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In499048575 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out499048575| ~x~0_In499048575) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out499048575| ~x$w_buff1~0_In499048575) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In499048575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499048575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In499048575, ~x~0=~x~0_In499048575} OutVars{~x$w_buff1~0=~x$w_buff1~0_In499048575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499048575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In499048575, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out499048575|, ~x~0=~x~0_In499048575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:22:05,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:22:05,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-338208222 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-338208222 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-338208222| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-338208222 |P1Thread1of1ForFork1_#t~ite34_Out-338208222|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-338208222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-338208222} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-338208222|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-338208222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-338208222} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:22:05,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1095791577 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1095791577 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1095791577 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1095791577 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1095791577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1095791577 |P1Thread1of1ForFork1_#t~ite35_Out1095791577|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1095791577, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1095791577, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1095791577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095791577} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1095791577, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1095791577, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1095791577|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1095791577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095791577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:22:05,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In71159340 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In71159340 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out71159340| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out71159340| ~x$r_buff0_thd2~0_In71159340)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In71159340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71159340} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In71159340, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out71159340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71159340} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:22:05,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-112755337 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-112755337 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-112755337 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-112755337 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-112755337| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-112755337| ~x$r_buff1_thd2~0_In-112755337)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-112755337, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-112755337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-112755337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112755337} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-112755337, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-112755337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-112755337, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-112755337|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112755337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:22:05,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:22:05,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, 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:22:05,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1550817807 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1550817807 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1550817807| |ULTIMATE.start_main_#t~ite40_Out-1550817807|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1550817807| ~x~0_In-1550817807) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-1550817807 |ULTIMATE.start_main_#t~ite40_Out-1550817807|) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1550817807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1550817807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1550817807, ~x~0=~x~0_In-1550817807} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1550817807|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1550817807|, ~x$w_buff1~0=~x$w_buff1~0_In-1550817807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1550817807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1550817807, ~x~0=~x~0_In-1550817807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:22:05,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-98773686 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-98773686 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-98773686|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-98773686 |ULTIMATE.start_main_#t~ite42_Out-98773686|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-98773686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98773686} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-98773686, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-98773686|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98773686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:22:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-139605691 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-139605691 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-139605691 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-139605691 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-139605691| ~x$w_buff1_used~0_In-139605691)) (and (= |ULTIMATE.start_main_#t~ite43_Out-139605691| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139605691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-139605691, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-139605691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139605691} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139605691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-139605691, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-139605691|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-139605691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139605691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:22:05,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In296933008 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In296933008 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out296933008| 0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In296933008 |ULTIMATE.start_main_#t~ite44_Out296933008|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In296933008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296933008} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In296933008, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out296933008|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296933008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:22:05,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In226663212 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In226663212 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In226663212 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In226663212 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out226663212| 0)) (and (= ~x$r_buff1_thd0~0_In226663212 |ULTIMATE.start_main_#t~ite45_Out226663212|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226663212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226663212, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226663212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226663212} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226663212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226663212, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226663212, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out226663212|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226663212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:22:05,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:05,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:05 BasicIcfg [2019-11-28 18:22:05,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:05,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:05,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:05,404 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:05,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:50" (3/4) ... [2019-11-28 18:22:05,407 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:05,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1605~0.base_31|) |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1605~0.offset_23| 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31|)) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1605~0.base_31| 4)) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1605~0.base_31|) (= 0 v_~x$r_buff0_thd2~0_279) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_31| 1)) (= 0 v_~x~0_116) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_~#t1605~0.base=|v_ULTIMATE.start_main_~#t1605~0.base_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1605~0.offset=|v_ULTIMATE.start_main_~#t1605~0.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ~y~0=v_~y~0_95, ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1605~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1605~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1606~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1606~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:05,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~y~0_Out1239339556 1) (= ~x$r_buff0_thd1~0_In1239339556 ~x$r_buff1_thd1~0_Out1239339556) (= ~x$r_buff1_thd2~0_Out1239339556 ~x$r_buff0_thd2~0_In1239339556) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556)) (= ~x$r_buff1_thd0~0_Out1239339556 ~x$r_buff0_thd0~0_In1239339556) (= 1 ~x$r_buff0_thd1~0_Out1239339556)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239339556, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1239339556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1239339556} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1239339556, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1239339556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1239339556, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1239339556, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1239339556, ~y~0=~y~0_Out1239339556, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1239339556, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1239339556} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:05,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t1606~0.offset_10| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11|) |v_ULTIMATE.start_main_~#t1606~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1606~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1606~0.base_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1606~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1606~0.offset, ULTIMATE.start_main_~#t1606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:22:05,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In905195788 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In905195788 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out905195788| ~x$w_buff0_used~0_In905195788)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out905195788| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In905195788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905195788} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out905195788|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In905195788, ~x$w_buff0_used~0=~x$w_buff0_used~0_In905195788} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:22:05,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-1649332172 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1649332172 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1649332172 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1649332172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1649332172| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1649332172| ~x$w_buff1_used~0_In-1649332172) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649332172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649332172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649332172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649332172} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1649332172|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649332172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649332172, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649332172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649332172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:22:05,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In422075889 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In422075889 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out422075889 ~x$r_buff0_thd1~0_In422075889))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out422075889)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In422075889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In422075889} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out422075889, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out422075889|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In422075889} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:22:05,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1077444158 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1077444158 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1077444158 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1077444158 256)))) (or (and (= ~x$r_buff1_thd1~0_In1077444158 |P0Thread1of1ForFork0_#t~ite8_Out1077444158|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1077444158|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1077444158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1077444158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1077444158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1077444158} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1077444158, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1077444158|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1077444158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1077444158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1077444158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:22:05,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:22:05,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:22:05,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1654057460 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1654057460 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1654057460 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1654057460 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1654057460 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out1654057460| |P1Thread1of1ForFork1_#t~ite29_Out1654057460|) (= ~x$r_buff1_thd2~0_In1654057460 |P1Thread1of1ForFork1_#t~ite29_Out1654057460|)) (and (not .cse1) (= ~x$r_buff1_thd2~0_In1654057460 |P1Thread1of1ForFork1_#t~ite30_Out1654057460|) (= |P1Thread1of1ForFork1_#t~ite29_In1654057460| |P1Thread1of1ForFork1_#t~ite29_Out1654057460|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1654057460|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654057460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1654057460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654057460, ~weak$$choice2~0=~weak$$choice2~0_In1654057460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654057460} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1654057460|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1654057460|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1654057460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1654057460, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1654057460, ~weak$$choice2~0=~weak$$choice2~0_In1654057460, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1654057460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:22:05,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:22:05,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In499048575 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In499048575 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out499048575| ~x~0_In499048575) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out499048575| ~x$w_buff1~0_In499048575) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In499048575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499048575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In499048575, ~x~0=~x~0_In499048575} OutVars{~x$w_buff1~0=~x$w_buff1~0_In499048575, ~x$w_buff1_used~0=~x$w_buff1_used~0_In499048575, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In499048575, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out499048575|, ~x~0=~x~0_In499048575} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:22:05,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:22:05,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-338208222 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-338208222 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-338208222| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-338208222 |P1Thread1of1ForFork1_#t~ite34_Out-338208222|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-338208222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-338208222} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-338208222|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-338208222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-338208222} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:22:05,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1095791577 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1095791577 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1095791577 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1095791577 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1095791577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1095791577 |P1Thread1of1ForFork1_#t~ite35_Out1095791577|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1095791577, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1095791577, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1095791577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095791577} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1095791577, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1095791577, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1095791577|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1095791577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1095791577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:22:05,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In71159340 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In71159340 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out71159340| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out71159340| ~x$r_buff0_thd2~0_In71159340)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In71159340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71159340} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In71159340, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out71159340|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71159340} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:22:05,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-112755337 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-112755337 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-112755337 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-112755337 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-112755337| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-112755337| ~x$r_buff1_thd2~0_In-112755337)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-112755337, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-112755337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-112755337, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112755337} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-112755337, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-112755337, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-112755337, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-112755337|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-112755337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:22:05,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:22:05,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, 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:22:05,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1550817807 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1550817807 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-1550817807| |ULTIMATE.start_main_#t~ite40_Out-1550817807|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1550817807| ~x~0_In-1550817807) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-1550817807 |ULTIMATE.start_main_#t~ite40_Out-1550817807|) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1550817807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1550817807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1550817807, ~x~0=~x~0_In-1550817807} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1550817807|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1550817807|, ~x$w_buff1~0=~x$w_buff1~0_In-1550817807, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1550817807, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1550817807, ~x~0=~x~0_In-1550817807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:22:05,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-98773686 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-98773686 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-98773686|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-98773686 |ULTIMATE.start_main_#t~ite42_Out-98773686|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-98773686, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98773686} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-98773686, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-98773686|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-98773686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:22:05,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-139605691 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-139605691 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-139605691 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-139605691 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-139605691| ~x$w_buff1_used~0_In-139605691)) (and (= |ULTIMATE.start_main_#t~ite43_Out-139605691| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139605691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-139605691, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-139605691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139605691} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-139605691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-139605691, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-139605691|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-139605691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-139605691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:22:05,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In296933008 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In296933008 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out296933008| 0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In296933008 |ULTIMATE.start_main_#t~ite44_Out296933008|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In296933008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296933008} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In296933008, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out296933008|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296933008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:22:05,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In226663212 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In226663212 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In226663212 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In226663212 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out226663212| 0)) (and (= ~x$r_buff1_thd0~0_In226663212 |ULTIMATE.start_main_#t~ite45_Out226663212|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226663212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226663212, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226663212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226663212} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In226663212, ~x$w_buff1_used~0=~x$w_buff1_used~0_In226663212, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In226663212, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out226663212|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In226663212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:22:05,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:05,505 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:05,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:05,509 INFO L168 Benchmark]: Toolchain (without parser) took 17008.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 515.9 MB). Free memory was 960.4 MB in the beginning and 769.0 MB in the end (delta: 191.3 MB). Peak memory consumption was 707.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,510 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:05,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:05,512 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,512 INFO L168 Benchmark]: RCFGBuilder took 753.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,515 INFO L168 Benchmark]: TraceAbstraction took 15167.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 407.9 MB). Free memory was 1.0 GB in the beginning and 781.9 MB in the end (delta: 237.8 MB). Peak memory consumption was 645.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,516 INFO L168 Benchmark]: Witness Printer took 104.22 ms. Allocated memory is still 1.5 GB. Free memory was 781.9 MB in the beginning and 769.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:05,522 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.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 871.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -119.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 753.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15167.38 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 407.9 MB). Free memory was 1.0 GB in the beginning and 781.9 MB in the end (delta: 237.8 MB). Peak memory consumption was 645.7 MB. Max. memory is 11.5 GB. * Witness Printer took 104.22 ms. Allocated memory is still 1.5 GB. Free memory was 781.9 MB in the beginning and 769.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=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=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1904 SDtfs, 1251 SDslu, 3121 SDs, 0 SdLazy, 1177 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18980occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 13464 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 39440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...