./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe022_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/safe022_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 7849b02df788e833596e9492b95b82c107a8b563 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:30:39,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:30:39,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:30:39,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:30:39,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:30:39,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:30:39,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:30:39,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:30:39,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:30:39,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:30:39,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:30:39,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:30:39,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:30:39,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:30:39,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:30:39,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:30:39,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:30:39,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:30:39,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:30:39,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:30:39,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:30:39,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:30:39,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:30:39,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:30:39,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:30:39,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:30:39,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:30:39,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:30:39,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:30:39,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:30:39,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:30:39,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:30:39,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:30:39,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:30:39,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:30:39,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:30:39,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:30:39,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:30:39,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:30:39,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:30:39,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:30:39,339 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:30:39,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:30:39,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:30:39,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:30:39,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:30:39,371 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:30:39,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:30:39,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:30:39,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:30:39,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:30:39,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:30:39,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:30:39,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:30:39,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:30:39,375 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:30:39,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:30:39,375 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:30:39,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:30:39,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:30:39,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:30:39,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:30:39,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:30:39,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:30:39,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:30:39,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:30:39,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:30:39,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:30:39,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:30:39,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:30:39,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:30:39,379 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 -> 7849b02df788e833596e9492b95b82c107a8b563 [2019-11-28 18:30:39,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:30:39,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:30:39,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:30:39,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:30:39,705 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:30:39,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.i [2019-11-28 18:30:39,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ba2ca0/b36a75e5d9394e92ae54eae50fe585f0/FLAG3e679a494 [2019-11-28 18:30:40,393 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:30:40,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe022_pso.oepc.i [2019-11-28 18:30:40,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ba2ca0/b36a75e5d9394e92ae54eae50fe585f0/FLAG3e679a494 [2019-11-28 18:30:40,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2ba2ca0/b36a75e5d9394e92ae54eae50fe585f0 [2019-11-28 18:30:40,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:30:40,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:30:40,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:40,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:30:40,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:30:40,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:40" (1/1) ... [2019-11-28 18:30:40,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553315ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:40, skipping insertion in model container [2019-11-28 18:30:40,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:30:40" (1/1) ... [2019-11-28 18:30:40,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:30:40,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:30:41,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:41,321 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:30:41,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:30:41,487 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:30:41,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41 WrapperNode [2019-11-28 18:30:41,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:30:41,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:41,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:30:41,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:30:41,500 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:30:41" (1/1) ... [2019-11-28 18:30:41,524 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:30:41" (1/1) ... [2019-11-28 18:30:41,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:30:41,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:30:41,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:30:41,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:30:41,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (1/1) ... [2019-11-28 18:30:41,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:30:41,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:30:41,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:30:41,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:30:41,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (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:30:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:30:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:30:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:30:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:30:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:30:41,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:30:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:30:41,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:30:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:30:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:30:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:30:41,700 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:30:42,421 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:30:42,422 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:30:42,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:42 BoogieIcfgContainer [2019-11-28 18:30:42,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:30:42,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:30:42,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:30:42,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:30:42,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:30:40" (1/3) ... [2019-11-28 18:30:42,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a283439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:42, skipping insertion in model container [2019-11-28 18:30:42,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:30:41" (2/3) ... [2019-11-28 18:30:42,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a283439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:30:42, skipping insertion in model container [2019-11-28 18:30:42,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:42" (3/3) ... [2019-11-28 18:30:42,438 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_pso.oepc.i [2019-11-28 18:30:42,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:30:42,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:30:42,458 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:30:42,459 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:30:42,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:30:42,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:30:42,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:30:42,608 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:30:42,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:30:42,608 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:30:42,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:30:42,609 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:30:42,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:30:42,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:30:42,630 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:30:42,632 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:42,711 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:42,711 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:42,726 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:42,749 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:30:42,796 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:30:42,796 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:30:42,810 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:30:42,829 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:30:42,831 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:30:47,343 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:30:47,448 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:30:47,529 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:30:47,529 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:30:47,533 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:30:48,107 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:30:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:30:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:30:48,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:48,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:30:48,120 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:30:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:30:48,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:48,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832104671] [2019-11-28 18:30:48,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:48,438 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:30:48,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832104671] [2019-11-28 18:30:48,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:48,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:30:48,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717992834] [2019-11-28 18:30:48,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:48,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:48,478 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:30:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:48,822 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:30:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:48,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:30:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:48,934 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:30:48,936 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:30:48,947 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:30:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:30:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:30:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:30:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:30:49,406 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:30:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:49,407 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:30:49,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:30:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:30:49,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:49,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:49,414 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:30:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:30:49,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:49,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501906339] [2019-11-28 18:30:49,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:49,584 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:30:49,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501906339] [2019-11-28 18:30:49,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:49,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:49,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994070003] [2019-11-28 18:30:49,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:49,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:49,589 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:30:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:49,994 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:30:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:49,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:30:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:50,069 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:30:50,070 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:30:50,072 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:30:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:30:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:30:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:30:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:30:50,489 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:30:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:50,490 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:30:50,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:30:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:30:50,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:50,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:50,503 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:30:50,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:30:50,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:50,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100424296] [2019-11-28 18:30:50,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:50,788 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:30:50,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100424296] [2019-11-28 18:30:50,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:50,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:50,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103902526] [2019-11-28 18:30:50,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:50,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:50,790 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:30:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,188 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:30:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:30:51,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:30:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,243 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:30:51,244 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:30:51,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:30:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:30:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:30:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:30:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:30:51,664 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:30:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:51,666 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:30:51,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:30:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:30:51,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:51,671 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:30:51,671 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:30:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:30:51,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:51,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396475994] [2019-11-28 18:30:51,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:51,772 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:30:51,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396475994] [2019-11-28 18:30:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:51,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:51,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632389024] [2019-11-28 18:30:51,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:51,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:51,775 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:30:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:51,848 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-11-28 18:30:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:30:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:51,884 INFO L225 Difference]: With dead ends: 10750 [2019-11-28 18:30:51,885 INFO L226 Difference]: Without dead ends: 10750 [2019-11-28 18:30:51,885 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:30:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-11-28 18:30:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-11-28 18:30:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-11-28 18:30:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-11-28 18:30:52,206 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-11-28 18:30:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:52,208 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-11-28 18:30:52,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-11-28 18:30:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:30:52,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:52,213 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:30:52,214 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:30:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-11-28 18:30:52,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:52,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318127765] [2019-11-28 18:30:52,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:52,325 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:30:52,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318127765] [2019-11-28 18:30:52,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:52,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:52,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809931062] [2019-11-28 18:30:52,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:30:52,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:30:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:30:52,327 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-11-28 18:30:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:52,361 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-11-28 18:30:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:30:52,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:30:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:52,366 INFO L225 Difference]: With dead ends: 2054 [2019-11-28 18:30:52,367 INFO L226 Difference]: Without dead ends: 1457 [2019-11-28 18:30:52,367 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:30:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-28 18:30:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-11-28 18:30:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-11-28 18:30:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-11-28 18:30:52,393 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-11-28 18:30:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:52,394 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-11-28 18:30:52,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:30:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-11-28 18:30:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:30:52,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:52,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:52,398 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:30:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:30:52,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:52,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204055907] [2019-11-28 18:30:52,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:52,515 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:30:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204055907] [2019-11-28 18:30:52,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:52,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:52,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641796521] [2019-11-28 18:30:52,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:30:52,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:30:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:52,519 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-11-28 18:30:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:52,899 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-11-28 18:30:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:30:52,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:30:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:52,906 INFO L225 Difference]: With dead ends: 2249 [2019-11-28 18:30:52,906 INFO L226 Difference]: Without dead ends: 2197 [2019-11-28 18:30:52,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:30:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-11-28 18:30:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-11-28 18:30:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-28 18:30:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-11-28 18:30:52,938 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-11-28 18:30:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-11-28 18:30:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:30:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-11-28 18:30:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:30:52,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:52,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:52,942 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:30:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-11-28 18:30:52,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:52,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838258241] [2019-11-28 18:30:52,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:53,099 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:30:53,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838258241] [2019-11-28 18:30:53,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:53,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:30:53,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894996966] [2019-11-28 18:30:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:53,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:53,102 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-11-28 18:30:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:53,152 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-11-28 18:30:53,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:30:53,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:30:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:53,154 INFO L225 Difference]: With dead ends: 752 [2019-11-28 18:30:53,155 INFO L226 Difference]: Without dead ends: 689 [2019-11-28 18:30:53,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:30:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-28 18:30:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-28 18:30:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-28 18:30:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-11-28 18:30:53,166 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-11-28 18:30:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:53,167 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-11-28 18:30:53,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-11-28 18:30:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:53,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:53,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:53,170 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:30:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:53,171 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-11-28 18:30:53,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:53,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962593525] [2019-11-28 18:30:53,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:53,271 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:30:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962593525] [2019-11-28 18:30:53,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:53,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:30:53,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326374362] [2019-11-28 18:30:53,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:53,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:53,274 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-11-28 18:30:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:53,646 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-11-28 18:30:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:30:53,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:30:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:53,649 INFO L225 Difference]: With dead ends: 1105 [2019-11-28 18:30:53,649 INFO L226 Difference]: Without dead ends: 1105 [2019-11-28 18:30:53,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-28 18:30:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-11-28 18:30:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-28 18:30:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-11-28 18:30:53,665 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-11-28 18:30:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:53,666 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-11-28 18:30:53,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-11-28 18:30:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:30:53,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:53,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:30:53,669 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:30:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-11-28 18:30:53,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:53,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994271315] [2019-11-28 18:30:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:53,743 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:30:53,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994271315] [2019-11-28 18:30:53,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:53,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:30:53,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977805164] [2019-11-28 18:30:53,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:30:53,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:30:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:30:53,746 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-11-28 18:30:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:53,798 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-11-28 18:30:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:30:53,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:30:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:53,801 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:30:53,801 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:30:53,802 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:30:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:30:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-11-28 18:30:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:30:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:30:53,819 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:30:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:53,819 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:30:53,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:30:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:30:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:53,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:53,822 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:30:53,822 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:30:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:30:53,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:53,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874913776] [2019-11-28 18:30:53,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:30:54,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874913776] [2019-11-28 18:30:54,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:54,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:30:54,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952872106] [2019-11-28 18:30:54,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:30:54,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:30:54,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:30:54,016 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 7 states. [2019-11-28 18:30:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:54,377 INFO L93 Difference]: Finished difference Result 2731 states and 5823 transitions. [2019-11-28 18:30:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:30:54,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:30:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:54,380 INFO L225 Difference]: With dead ends: 2731 [2019-11-28 18:30:54,381 INFO L226 Difference]: Without dead ends: 1921 [2019-11-28 18:30:54,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:30:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-11-28 18:30:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1024. [2019-11-28 18:30:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2019-11-28 18:30:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2232 transitions. [2019-11-28 18:30:54,403 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2232 transitions. Word has length 52 [2019-11-28 18:30:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:54,403 INFO L462 AbstractCegarLoop]: Abstraction has 1024 states and 2232 transitions. [2019-11-28 18:30:54,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:30:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2232 transitions. [2019-11-28 18:30:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:54,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:54,408 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:30:54,408 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:30:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash 541363326, now seen corresponding path program 2 times [2019-11-28 18:30:54,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:54,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999752738] [2019-11-28 18:30:54,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:54,559 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:30:54,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999752738] [2019-11-28 18:30:54,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:54,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:30:54,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714552132] [2019-11-28 18:30:54,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:30:54,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:30:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:30:54,562 INFO L87 Difference]: Start difference. First operand 1024 states and 2232 transitions. Second operand 5 states. [2019-11-28 18:30:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:54,585 INFO L93 Difference]: Finished difference Result 1761 states and 3866 transitions. [2019-11-28 18:30:54,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:30:54,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:30:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:54,587 INFO L225 Difference]: With dead ends: 1761 [2019-11-28 18:30:54,587 INFO L226 Difference]: Without dead ends: 806 [2019-11-28 18:30:54,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:30:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-11-28 18:30:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2019-11-28 18:30:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-11-28 18:30:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1764 transitions. [2019-11-28 18:30:54,602 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1764 transitions. Word has length 52 [2019-11-28 18:30:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:54,603 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1764 transitions. [2019-11-28 18:30:54,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:30:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1764 transitions. [2019-11-28 18:30:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:54,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:54,605 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:30:54,605 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:30:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 3 times [2019-11-28 18:30:54,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:54,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508819295] [2019-11-28 18:30:54,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:55,000 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:30:55,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508819295] [2019-11-28 18:30:55,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:55,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:30:55,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936002412] [2019-11-28 18:30:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:30:55,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:30:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:30:55,003 INFO L87 Difference]: Start difference. First operand 806 states and 1764 transitions. Second operand 13 states. [2019-11-28 18:30:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:56,324 INFO L93 Difference]: Finished difference Result 1133 states and 2400 transitions. [2019-11-28 18:30:56,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:30:56,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:30:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:56,327 INFO L225 Difference]: With dead ends: 1133 [2019-11-28 18:30:56,327 INFO L226 Difference]: Without dead ends: 912 [2019-11-28 18:30:56,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-28 18:30:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-28 18:30:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 830. [2019-11-28 18:30:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-28 18:30:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1821 transitions. [2019-11-28 18:30:56,339 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1821 transitions. Word has length 52 [2019-11-28 18:30:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:56,340 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1821 transitions. [2019-11-28 18:30:56,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:30:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1821 transitions. [2019-11-28 18:30:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:56,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:56,342 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:30:56,343 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:30:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 4 times [2019-11-28 18:30:56,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:56,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803923849] [2019-11-28 18:30:56,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:30:56,446 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:30:56,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803923849] [2019-11-28 18:30:56,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:30:56,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:30:56,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877852913] [2019-11-28 18:30:56,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:30:56,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:30:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:30:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:30:56,449 INFO L87 Difference]: Start difference. First operand 830 states and 1821 transitions. Second operand 7 states. [2019-11-28 18:30:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:30:56,672 INFO L93 Difference]: Finished difference Result 1337 states and 2828 transitions. [2019-11-28 18:30:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:30:56,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:30:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:30:56,674 INFO L225 Difference]: With dead ends: 1337 [2019-11-28 18:30:56,674 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 18:30:56,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:30:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 18:30:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 782. [2019-11-28 18:30:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-28 18:30:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1714 transitions. [2019-11-28 18:30:56,694 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1714 transitions. Word has length 52 [2019-11-28 18:30:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:30:56,694 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1714 transitions. [2019-11-28 18:30:56,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:30:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1714 transitions. [2019-11-28 18:30:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:30:56,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:30:56,698 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:30:56,698 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:30:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:30:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 5 times [2019-11-28 18:30:56,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:30:56,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723239894] [2019-11-28 18:30:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:30:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:30:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:30:56,859 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:30:56,860 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:30:56,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 |v_ULTIMATE.start_main_~#t2309~0.offset_31|) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48| 1)) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| 4)) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2309~0.base_48|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48|) |v_ULTIMATE.start_main_~#t2309~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2309~0.offset=|v_ULTIMATE.start_main_~#t2309~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2309~0.base=|v_ULTIMATE.start_main_~#t2309~0.base_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_31|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_49|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2309~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2310~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:56,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2310~0.base_13|) (= |v_ULTIMATE.start_main_~#t2310~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2310~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13|) |v_ULTIMATE.start_main_~#t2310~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2310~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, #length] because there is no mapped edge [2019-11-28 18:30:56,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~x~0_Out-1623947560) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560 0)) (= ~y$r_buff0_thd1~0_In-1623947560 ~y$r_buff1_thd1~0_Out-1623947560) (= ~y$r_buff1_thd2~0_Out-1623947560 ~y$r_buff0_thd2~0_In-1623947560) (= ~y$r_buff1_thd0~0_Out-1623947560 ~y$r_buff0_thd0~0_In-1623947560) (= 1 ~y$r_buff0_thd1~0_Out-1623947560)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1623947560, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1623947560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623947560, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1623947560, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1623947560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1623947560, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1623947560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623947560, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560, ~x~0=~x~0_Out-1623947560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1623947560} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:30:56,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1366355049 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1366355049 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1366355049|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1366355049 |P0Thread1of1ForFork0_#t~ite5_Out1366355049|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1366355049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1366355049} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1366355049|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1366355049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1366355049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:30:56,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In685395281 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In685395281 256)))) (or (and (= (mod ~y$w_buff1_used~0_In685395281 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In685395281 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In685395281 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out685395281| |P1Thread1of1ForFork1_#t~ite20_Out685395281|) (= ~y$w_buff0_used~0_In685395281 |P1Thread1of1ForFork1_#t~ite20_Out685395281|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In685395281| |P1Thread1of1ForFork1_#t~ite20_Out685395281|) (not .cse0) (= ~y$w_buff0_used~0_In685395281 |P1Thread1of1ForFork1_#t~ite21_Out685395281|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In685395281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In685395281, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In685395281|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In685395281, ~weak$$choice2~0=~weak$$choice2~0_In685395281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In685395281} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In685395281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In685395281, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out685395281|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In685395281, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out685395281|, ~weak$$choice2~0=~weak$$choice2~0_In685395281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In685395281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:30:56,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In118899056 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In118899056 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In118899056 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out118899056| |P1Thread1of1ForFork1_#t~ite23_Out118899056|)) (.cse1 (= (mod ~y$w_buff1_used~0_In118899056 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In118899056 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In118899056| |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| ~y$w_buff1_used~0_In118899056) (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out118899056| ~y$w_buff1_used~0_In118899056) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| |P1Thread1of1ForFork1_#t~ite23_In118899056|)))) (let ((.cse6 (not .cse0))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (or (not .cse2) .cse6) .cse4 (not .cse3) .cse5 (or .cse6 (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118899056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118899056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In118899056|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In118899056|, ~weak$$choice2~0=~weak$$choice2~0_In118899056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118899056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118899056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118899056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out118899056|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out118899056|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out118899056|, ~weak$$choice2~0=~weak$$choice2~0_In118899056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118899056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:30:56,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2058170109 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2058170109 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2058170109 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2058170109|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2058170109 |P0Thread1of1ForFork0_#t~ite6_Out-2058170109|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058170109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2058170109|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058170109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:30:56,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out-23099656 ~y$r_buff0_thd1~0_In-23099656)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-23099656 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-23099656 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-23099656)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-23099656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-23099656|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-23099656} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:30:56,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1953532097 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1953532097 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1953532097 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1953532097 256)))) (or (and (= ~y$r_buff1_thd1~0_In-1953532097 |P0Thread1of1ForFork0_#t~ite8_Out-1953532097|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1953532097|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953532097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953532097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953532097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953532097} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953532097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953532097, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1953532097|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953532097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953532097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:30:56,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:56,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1557437463 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1557437463| |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) .cse0 (= ~y$r_buff1_thd2~0_In1557437463 |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1557437463 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1557437463 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1557437463 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1557437463 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In1557437463| |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) (not .cse0) (= ~y$r_buff1_thd2~0_In1557437463 |P1Thread1of1ForFork1_#t~ite30_Out1557437463|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1557437463, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1557437463|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1557437463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557437463, ~weak$$choice2~0=~weak$$choice2~0_In1557437463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1557437463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1557437463, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1557437463|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1557437463|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1557437463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557437463, ~weak$$choice2~0=~weak$$choice2~0_In1557437463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1557437463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:30:56,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:30:56,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In589837108 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In589837108 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out589837108| ~y$w_buff1~0_In589837108) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out589837108| ~y~0_In589837108)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In589837108, ~y$w_buff1~0=~y$w_buff1~0_In589837108, ~y~0=~y~0_In589837108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589837108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In589837108, ~y$w_buff1~0=~y$w_buff1~0_In589837108, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out589837108|, ~y~0=~y~0_In589837108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589837108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:30:56,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |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|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:30:56,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1261990933 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1261990933 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1261990933| ~y$w_buff0_used~0_In1261990933)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1261990933| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1261990933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261990933} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1261990933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261990933, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1261990933|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:30:56,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1038494041 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1038494041 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1038494041 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1038494041 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1038494041|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1038494041 |P1Thread1of1ForFork1_#t~ite35_Out-1038494041|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038494041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038494041} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038494041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1038494041|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038494041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:30:56,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2035516260 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2035516260 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out2035516260| 0)) (and (= ~y$r_buff0_thd2~0_In2035516260 |P1Thread1of1ForFork1_#t~ite36_Out2035516260|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2035516260, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2035516260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2035516260, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2035516260, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2035516260|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:30:56,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1580302432 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1580302432 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1580302432 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1580302432 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1580302432 |P1Thread1of1ForFork1_#t~ite37_Out-1580302432|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1580302432|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580302432, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580302432, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580302432, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1580302432|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:56,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:56,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:30:56,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:30:56,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-524327450 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-524327450 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-524327450| ~y$w_buff1~0_In-524327450) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-524327450 |ULTIMATE.start_main_#t~ite40_Out-524327450|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-524327450, ~y~0=~y~0_In-524327450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-524327450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-524327450} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-524327450|, ~y$w_buff1~0=~y$w_buff1~0_In-524327450, ~y~0=~y~0_In-524327450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-524327450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-524327450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:30:56,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:30:56,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1191515578 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1191515578 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1191515578|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1191515578 |ULTIMATE.start_main_#t~ite42_Out-1191515578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1191515578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1191515578, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1191515578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:30:56,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In904429865 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In904429865 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In904429865 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In904429865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out904429865| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In904429865 |ULTIMATE.start_main_#t~ite43_Out904429865|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In904429865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In904429865, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out904429865|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:30:56,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-934680877 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-934680877 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-934680877| ~y$r_buff0_thd0~0_In-934680877)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-934680877| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934680877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-934680877} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-934680877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-934680877, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-934680877|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:30:56,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1729363777 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1729363777 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1729363777 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1729363777 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1729363777| ~y$r_buff1_thd0~0_In-1729363777)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1729363777| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729363777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1729363777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1729363777, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729363777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729363777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1729363777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1729363777, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1729363777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729363777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:30:56,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:30:56,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:30:56 BasicIcfg [2019-11-28 18:30:56,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:30:56,991 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:30:56,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:30:56,992 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:30:56,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:30:42" (3/4) ... [2019-11-28 18:30:56,995 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:30:56,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 |v_ULTIMATE.start_main_~#t2309~0.offset_31|) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48| 1)) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| 4)) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2309~0.base_48|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2309~0.base_48|) |v_ULTIMATE.start_main_~#t2309~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2309~0.base_48|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2309~0.offset=|v_ULTIMATE.start_main_~#t2309~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2309~0.base=|v_ULTIMATE.start_main_~#t2309~0.base_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_31|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_49|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2309~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2309~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2310~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:56,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2310~0.base_13|) (= |v_ULTIMATE.start_main_~#t2310~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2310~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| 4)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2310~0.base_13|) |v_ULTIMATE.start_main_~#t2310~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2310~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2310~0.offset=|v_ULTIMATE.start_main_~#t2310~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t2310~0.base=|v_ULTIMATE.start_main_~#t2310~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2310~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2310~0.base, #length] because there is no mapped edge [2019-11-28 18:30:56,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~x~0_Out-1623947560) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560 0)) (= ~y$r_buff0_thd1~0_In-1623947560 ~y$r_buff1_thd1~0_Out-1623947560) (= ~y$r_buff1_thd2~0_Out-1623947560 ~y$r_buff0_thd2~0_In-1623947560) (= ~y$r_buff1_thd0~0_Out-1623947560 ~y$r_buff0_thd0~0_In-1623947560) (= 1 ~y$r_buff0_thd1~0_Out-1623947560)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1623947560, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1623947560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623947560, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1623947560, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1623947560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1623947560, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1623947560, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1623947560, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1623947560, ~x~0=~x~0_Out-1623947560, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1623947560} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:30:57,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1366355049 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1366355049 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1366355049|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1366355049 |P0Thread1of1ForFork0_#t~ite5_Out1366355049|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1366355049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1366355049} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1366355049|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1366355049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1366355049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:30:57,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In685395281 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In685395281 256)))) (or (and (= (mod ~y$w_buff1_used~0_In685395281 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In685395281 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In685395281 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out685395281| |P1Thread1of1ForFork1_#t~ite20_Out685395281|) (= ~y$w_buff0_used~0_In685395281 |P1Thread1of1ForFork1_#t~ite20_Out685395281|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In685395281| |P1Thread1of1ForFork1_#t~ite20_Out685395281|) (not .cse0) (= ~y$w_buff0_used~0_In685395281 |P1Thread1of1ForFork1_#t~ite21_Out685395281|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In685395281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In685395281, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In685395281|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In685395281, ~weak$$choice2~0=~weak$$choice2~0_In685395281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In685395281} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In685395281, ~y$w_buff0_used~0=~y$w_buff0_used~0_In685395281, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out685395281|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In685395281, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out685395281|, ~weak$$choice2~0=~weak$$choice2~0_In685395281, ~y$w_buff1_used~0=~y$w_buff1_used~0_In685395281} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:30:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In118899056 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In118899056 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In118899056 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out118899056| |P1Thread1of1ForFork1_#t~ite23_Out118899056|)) (.cse1 (= (mod ~y$w_buff1_used~0_In118899056 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In118899056 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In118899056| |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| ~y$w_buff1_used~0_In118899056) (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) .cse4 .cse5) (and (= |P1Thread1of1ForFork1_#t~ite24_Out118899056| ~y$w_buff1_used~0_In118899056) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| |P1Thread1of1ForFork1_#t~ite23_In118899056|)))) (let ((.cse6 (not .cse0))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (= |P1Thread1of1ForFork1_#t~ite23_Out118899056| |P1Thread1of1ForFork1_#t~ite22_Out118899056|) (or (not .cse2) .cse6) .cse4 (not .cse3) .cse5 (or .cse6 (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118899056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118899056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In118899056|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In118899056|, ~weak$$choice2~0=~weak$$choice2~0_In118899056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118899056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118899056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118899056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out118899056|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out118899056|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out118899056|, ~weak$$choice2~0=~weak$$choice2~0_In118899056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118899056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:30:57,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2058170109 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2058170109 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2058170109 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2058170109|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-2058170109 |P0Thread1of1ForFork0_#t~ite6_Out-2058170109|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058170109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2058170109|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2058170109, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2058170109, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2058170109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:30:57,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out-23099656 ~y$r_buff0_thd1~0_In-23099656)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-23099656 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-23099656 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-23099656)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-23099656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-23099656|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-23099656} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:30:57,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1953532097 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1953532097 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1953532097 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1953532097 256)))) (or (and (= ~y$r_buff1_thd1~0_In-1953532097 |P0Thread1of1ForFork0_#t~ite8_Out-1953532097|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1953532097|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953532097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953532097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953532097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953532097} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1953532097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1953532097, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1953532097|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1953532097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1953532097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:30:57,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:30:57,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1557437463 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out1557437463| |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) .cse0 (= ~y$r_buff1_thd2~0_In1557437463 |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1557437463 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1557437463 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1557437463 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1557437463 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite29_In1557437463| |P1Thread1of1ForFork1_#t~ite29_Out1557437463|) (not .cse0) (= ~y$r_buff1_thd2~0_In1557437463 |P1Thread1of1ForFork1_#t~ite30_Out1557437463|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1557437463, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1557437463|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1557437463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557437463, ~weak$$choice2~0=~weak$$choice2~0_In1557437463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1557437463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1557437463, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1557437463|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1557437463|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1557437463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1557437463, ~weak$$choice2~0=~weak$$choice2~0_In1557437463, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1557437463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:30:57,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In589837108 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In589837108 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out589837108| ~y$w_buff1~0_In589837108) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out589837108| ~y~0_In589837108)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In589837108, ~y$w_buff1~0=~y$w_buff1~0_In589837108, ~y~0=~y~0_In589837108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589837108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In589837108, ~y$w_buff1~0=~y$w_buff1~0_In589837108, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out589837108|, ~y~0=~y~0_In589837108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589837108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:30:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |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|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1261990933 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1261990933 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1261990933| ~y$w_buff0_used~0_In1261990933)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1261990933| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1261990933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261990933} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1261990933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261990933, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1261990933|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:30:57,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1038494041 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1038494041 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1038494041 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1038494041 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1038494041|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1038494041 |P1Thread1of1ForFork1_#t~ite35_Out-1038494041|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038494041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038494041} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038494041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1038494041|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038494041} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:30:57,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2035516260 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2035516260 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out2035516260| 0)) (and (= ~y$r_buff0_thd2~0_In2035516260 |P1Thread1of1ForFork1_#t~ite36_Out2035516260|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2035516260, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2035516260} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2035516260, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2035516260, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2035516260|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:30:57,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1580302432 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1580302432 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1580302432 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1580302432 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1580302432 |P1Thread1of1ForFork1_#t~ite37_Out-1580302432|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1580302432|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580302432, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580302432, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580302432, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1580302432|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:30:57,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:30:57,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:30:57,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-524327450 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-524327450 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-524327450| ~y$w_buff1~0_In-524327450) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-524327450 |ULTIMATE.start_main_#t~ite40_Out-524327450|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-524327450, ~y~0=~y~0_In-524327450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-524327450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-524327450} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-524327450|, ~y$w_buff1~0=~y$w_buff1~0_In-524327450, ~y~0=~y~0_In-524327450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-524327450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-524327450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:30:57,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:30:57,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1191515578 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1191515578 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1191515578|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1191515578 |ULTIMATE.start_main_#t~ite42_Out-1191515578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1191515578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1191515578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1191515578, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1191515578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:30:57,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In904429865 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In904429865 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In904429865 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In904429865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out904429865| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In904429865 |ULTIMATE.start_main_#t~ite43_Out904429865|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In904429865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In904429865, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out904429865|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:30:57,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-934680877 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-934680877 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-934680877| ~y$r_buff0_thd0~0_In-934680877)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-934680877| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934680877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-934680877} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-934680877, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-934680877, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-934680877|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:30:57,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1729363777 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1729363777 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1729363777 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1729363777 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1729363777| ~y$r_buff1_thd0~0_In-1729363777)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1729363777| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729363777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1729363777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1729363777, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729363777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1729363777, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1729363777, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1729363777, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1729363777|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1729363777} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:30:57,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:30:57,089 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:30:57,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:30:57,091 INFO L168 Benchmark]: Toolchain (without parser) took 16387.80 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 517.5 MB). Free memory was 960.4 MB in the beginning and 848.9 MB in the end (delta: 111.4 MB). Peak memory consumption was 628.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,092 INFO L168 Benchmark]: CDTParser took 0.32 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:30:57,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:30:57,093 INFO L168 Benchmark]: Boogie Preprocessor took 44.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,094 INFO L168 Benchmark]: RCFGBuilder took 806.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,095 INFO L168 Benchmark]: TraceAbstraction took 14565.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 394.3 MB). Free memory was 1.0 GB in the beginning and 862.3 MB in the end (delta: 168.8 MB). Peak memory consumption was 563.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,095 INFO L168 Benchmark]: Witness Printer took 98.05 ms. Allocated memory is still 1.5 GB. Free memory was 862.3 MB in the beginning and 848.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:30:57,099 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.32 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 783.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 806.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14565.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 394.3 MB). Free memory was 1.0 GB in the beginning and 862.3 MB in the end (delta: 168.8 MB). Peak memory consumption was 563.1 MB. Max. memory is 11.5 GB. * Witness Printer took 98.05 ms. Allocated memory is still 1.5 GB. Free memory was 862.3 MB in the beginning and 848.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2309, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2310, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) 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, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y 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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1546 SDtfs, 2220 SDslu, 3835 SDs, 0 SdLazy, 2437 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 6768 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 88536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...