./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix048_tso.opt.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/mix048_tso.opt.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 5d6d3189de9937f8d4ddbc2d1af775ea2256235b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:17:25,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:17:25,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:17:25,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:17:25,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:17:25,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:17:25,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:17:25,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:17:25,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:17:25,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:17:25,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:17:25,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:17:25,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:17:25,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:17:25,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:17:25,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:17:25,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:17:25,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:17:25,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:17:25,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:17:25,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:17:25,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:17:25,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:17:25,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:17:25,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:17:25,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:17:25,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:17:25,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:17:25,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:17:25,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:17:25,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:17:25,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:17:25,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:17:25,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:17:25,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:17:25,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:17:25,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:17:25,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:17:25,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:17:25,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:17:25,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:17:25,408 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:17:25,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:17:25,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:17:25,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:17:25,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:17:25,426 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:17:25,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:17:25,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:17:25,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:17:25,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:17:25,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:17:25,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:17:25,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:17:25,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:17:25,428 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:17:25,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:17:25,429 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:17:25,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:17:25,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:17:25,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:17:25,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:17:25,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:17:25,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:17:25,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:17:25,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:17:25,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:17:25,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:17:25,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:17:25,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:17:25,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:17:25,433 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 -> 5d6d3189de9937f8d4ddbc2d1af775ea2256235b [2019-11-28 18:17:25,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:17:25,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:17:25,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:17:25,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:17:25,847 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:17:25,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix048_tso.opt.i [2019-11-28 18:17:25,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05c6f01f/0cf46a020a30494ea74e24a96f4171b1/FLAGacb6c9131 [2019-11-28 18:17:26,548 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:17:26,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix048_tso.opt.i [2019-11-28 18:17:26,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05c6f01f/0cf46a020a30494ea74e24a96f4171b1/FLAGacb6c9131 [2019-11-28 18:17:26,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05c6f01f/0cf46a020a30494ea74e24a96f4171b1 [2019-11-28 18:17:26,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:17:26,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:17:26,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:17:26,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:17:26,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:17:26,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:26" (1/1) ... [2019-11-28 18:17:26,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dda6276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:26, skipping insertion in model container [2019-11-28 18:17:26,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:26" (1/1) ... [2019-11-28 18:17:26,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:17:26,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:17:27,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:17:27,307 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:17:27,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:17:27,452 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:17:27,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27 WrapperNode [2019-11-28 18:17:27,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:17:27,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:17:27,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:17:27,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:17:27,464 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:17:27" (1/1) ... [2019-11-28 18:17:27,500 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:17:27" (1/1) ... [2019-11-28 18:17:27,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:17:27,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:17:27,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:17:27,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:17:27,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (1/1) ... [2019-11-28 18:17:27,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:17:27,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:17:27,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:17:27,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:17:27,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (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:17:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:17:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:17:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:17:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:17:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:17:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:17:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:17:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:17:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:17:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:17:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:17:27,698 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:17:28,468 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:17:28,469 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:17:28,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:28 BoogieIcfgContainer [2019-11-28 18:17:28,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:17:28,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:17:28,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:17:28,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:17:28,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:17:26" (1/3) ... [2019-11-28 18:17:28,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc0ba36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:28, skipping insertion in model container [2019-11-28 18:17:28,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:27" (2/3) ... [2019-11-28 18:17:28,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc0ba36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:28, skipping insertion in model container [2019-11-28 18:17:28,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:28" (3/3) ... [2019-11-28 18:17:28,479 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_tso.opt.i [2019-11-28 18:17:28,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:17:28,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:17:28,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:17:28,500 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:17:28,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,550 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:17:28,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:17:28,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:17:28,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:17:28,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:17:28,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:17:28,616 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:17:28,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:17:28,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:17:28,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:17:28,635 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:17:28,637 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:17:28,723 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:17:28,724 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:17:28,739 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:17:28,762 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:17:28,838 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:17:28,838 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:17:28,848 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:17:28,870 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:17:28,871 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:17:33,503 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:17:33,630 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:17:33,714 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:17:33,715 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:17:33,718 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:17:34,297 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:17:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:17:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:17:34,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:34,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:17:34,310 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:17:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:17:34,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:34,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222409842] [2019-11-28 18:17:34,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:34,608 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:17:34,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222409842] [2019-11-28 18:17:34,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:34,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:17:34,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741676210] [2019-11-28 18:17:34,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:17:34,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:17:34,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:17:34,645 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:17:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:34,898 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:17:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:17:34,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:17:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:35,010 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:17:35,018 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:17:35,020 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:17:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:17:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:17:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:17:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:17:35,443 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:17:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:35,443 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:17:35,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:17:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:17:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:17:35,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:35,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:17:35,447 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:17:35,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:35,448 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:17:35,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:35,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301232637] [2019-11-28 18:17:35,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:35,548 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:17:35,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301232637] [2019-11-28 18:17:35,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:35,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:17:35,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839695208] [2019-11-28 18:17:35,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:17:35,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:17:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:17:35,554 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:17:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:35,642 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-11-28 18:17:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:17:35,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:17:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:35,651 INFO L225 Difference]: With dead ends: 1760 [2019-11-28 18:17:35,651 INFO L226 Difference]: Without dead ends: 1292 [2019-11-28 18:17:35,652 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:17:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-11-28 18:17:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-11-28 18:17:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-11-28 18:17:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-11-28 18:17:35,695 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-11-28 18:17:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:35,696 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-11-28 18:17:35,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:17:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-11-28 18:17:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:17:35,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:35,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:17:35,705 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:17:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:17:35,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:35,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279996648] [2019-11-28 18:17:35,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:35,838 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:17:35,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279996648] [2019-11-28 18:17:35,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:35,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:17:35,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135252424] [2019-11-28 18:17:35,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:17:35,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:17:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:17:35,841 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-11-28 18:17:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:36,139 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-11-28 18:17:36,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:17:36,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:17:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:36,150 INFO L225 Difference]: With dead ends: 1855 [2019-11-28 18:17:36,151 INFO L226 Difference]: Without dead ends: 1854 [2019-11-28 18:17:36,151 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:17:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-28 18:17:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-11-28 18:17:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-11-28 18:17:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-11-28 18:17:36,210 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-11-28 18:17:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:36,212 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-11-28 18:17:36,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:17:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-11-28 18:17:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:17:36,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:36,215 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:17:36,216 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:17:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:17:36,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:36,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28495851] [2019-11-28 18:17:36,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:17:36,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28495851] [2019-11-28 18:17:36,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:36,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:17:36,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384969487] [2019-11-28 18:17:36,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:17:36,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:17:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:17:36,335 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-11-28 18:17:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:36,730 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-11-28 18:17:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:17:36,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:17:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:36,746 INFO L225 Difference]: With dead ends: 2337 [2019-11-28 18:17:36,746 INFO L226 Difference]: Without dead ends: 2285 [2019-11-28 18:17:36,747 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:17:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-11-28 18:17:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-11-28 18:17:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-11-28 18:17:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-11-28 18:17:36,813 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-11-28 18:17:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:36,814 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-11-28 18:17:36,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:17:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-11-28 18:17:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:17:36,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:36,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:17:36,817 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:17:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-11-28 18:17:36,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:36,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323081454] [2019-11-28 18:17:36,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:36,969 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:17:36,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323081454] [2019-11-28 18:17:36,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:36,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:17:36,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539803718] [2019-11-28 18:17:36,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:17:36,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:17:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:17:36,973 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-11-28 18:17:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:37,494 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-11-28 18:17:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:17:37,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:17:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:37,507 INFO L225 Difference]: With dead ends: 2383 [2019-11-28 18:17:37,508 INFO L226 Difference]: Without dead ends: 2383 [2019-11-28 18:17:37,508 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:17:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-11-28 18:17:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-11-28 18:17:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-28 18:17:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-11-28 18:17:37,562 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-11-28 18:17:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:37,563 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-11-28 18:17:37,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:17:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-11-28 18:17:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:17:37,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:37,567 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:17:37,567 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:17:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-11-28 18:17:37,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:37,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768643277] [2019-11-28 18:17:37,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:37,655 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:17:37,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768643277] [2019-11-28 18:17:37,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:37,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:17:37,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060554540] [2019-11-28 18:17:37,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:17:37,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:17:37,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:17:37,659 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-11-28 18:17:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:37,703 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-11-28 18:17:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:17:37,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:17:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:37,719 INFO L225 Difference]: With dead ends: 1286 [2019-11-28 18:17:37,719 INFO L226 Difference]: Without dead ends: 1165 [2019-11-28 18:17:37,719 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:17:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-11-28 18:17:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-11-28 18:17:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-28 18:17:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-11-28 18:17:37,752 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-11-28 18:17:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:37,753 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-11-28 18:17:37,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:17:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-11-28 18:17:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:17:37,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:37,761 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] [2019-11-28 18:17:37,761 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:17:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-11-28 18:17:37,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:37,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083411039] [2019-11-28 18:17:37,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:37,906 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:17:37,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083411039] [2019-11-28 18:17:37,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:37,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:17:37,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368330576] [2019-11-28 18:17:37,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:17:37,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:17:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:17:37,908 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 3 states. [2019-11-28 18:17:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:37,966 INFO L93 Difference]: Finished difference Result 1488 states and 3143 transitions. [2019-11-28 18:17:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:17:37,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:17:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:37,972 INFO L225 Difference]: With dead ends: 1488 [2019-11-28 18:17:37,972 INFO L226 Difference]: Without dead ends: 1488 [2019-11-28 18:17:37,973 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:17:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-11-28 18:17:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1171. [2019-11-28 18:17:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-11-28 18:17:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2513 transitions. [2019-11-28 18:17:38,003 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2513 transitions. Word has length 50 [2019-11-28 18:17:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:38,003 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 2513 transitions. [2019-11-28 18:17:38,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:17:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2513 transitions. [2019-11-28 18:17:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:17:38,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:38,007 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:17:38,007 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:17:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2032930801, now seen corresponding path program 1 times [2019-11-28 18:17:38,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:38,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992518542] [2019-11-28 18:17:38,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:38,106 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:17:38,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992518542] [2019-11-28 18:17:38,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:38,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:17:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385980373] [2019-11-28 18:17:38,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:17:38,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:17:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:17:38,108 INFO L87 Difference]: Start difference. First operand 1171 states and 2513 transitions. Second operand 6 states. [2019-11-28 18:17:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:38,535 INFO L93 Difference]: Finished difference Result 1382 states and 2902 transitions. [2019-11-28 18:17:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:17:38,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-28 18:17:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:38,541 INFO L225 Difference]: With dead ends: 1382 [2019-11-28 18:17:38,542 INFO L226 Difference]: Without dead ends: 1382 [2019-11-28 18:17:38,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:17:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-11-28 18:17:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1153. [2019-11-28 18:17:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-28 18:17:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2474 transitions. [2019-11-28 18:17:38,570 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2474 transitions. Word has length 51 [2019-11-28 18:17:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:38,570 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2474 transitions. [2019-11-28 18:17:38,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:17:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2474 transitions. [2019-11-28 18:17:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:17:38,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:38,573 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:17:38,574 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:17:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1871822573, now seen corresponding path program 2 times [2019-11-28 18:17:38,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:38,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703217004] [2019-11-28 18:17:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:38,848 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:17:38,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703217004] [2019-11-28 18:17:38,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:38,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:17:38,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211233595] [2019-11-28 18:17:38,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:17:38,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:38,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:17:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:17:38,850 INFO L87 Difference]: Start difference. First operand 1153 states and 2474 transitions. Second operand 11 states. [2019-11-28 18:17:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:40,541 INFO L93 Difference]: Finished difference Result 3998 states and 8740 transitions. [2019-11-28 18:17:40,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:17:40,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-11-28 18:17:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:40,562 INFO L225 Difference]: With dead ends: 3998 [2019-11-28 18:17:40,563 INFO L226 Difference]: Without dead ends: 3326 [2019-11-28 18:17:40,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2019-11-28 18:17:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-11-28 18:17:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 1695. [2019-11-28 18:17:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-28 18:17:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 3776 transitions. [2019-11-28 18:17:40,615 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 3776 transitions. Word has length 51 [2019-11-28 18:17:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:40,615 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 3776 transitions. [2019-11-28 18:17:40,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:17:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 3776 transitions. [2019-11-28 18:17:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:17:40,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:40,620 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:17:40,620 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:17:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 78278375, now seen corresponding path program 3 times [2019-11-28 18:17:40,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:40,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733828345] [2019-11-28 18:17:40,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:40,698 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:17:40,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733828345] [2019-11-28 18:17:40,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:40,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:17:40,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996126800] [2019-11-28 18:17:40,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:17:40,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:17:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:17:40,700 INFO L87 Difference]: Start difference. First operand 1695 states and 3776 transitions. Second operand 3 states. [2019-11-28 18:17:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:40,719 INFO L93 Difference]: Finished difference Result 1694 states and 3774 transitions. [2019-11-28 18:17:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:17:40,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:17:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:40,723 INFO L225 Difference]: With dead ends: 1694 [2019-11-28 18:17:40,724 INFO L226 Difference]: Without dead ends: 1694 [2019-11-28 18:17:40,724 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:17:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2019-11-28 18:17:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1484. [2019-11-28 18:17:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2019-11-28 18:17:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 3370 transitions. [2019-11-28 18:17:40,807 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 3370 transitions. Word has length 51 [2019-11-28 18:17:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:40,807 INFO L462 AbstractCegarLoop]: Abstraction has 1484 states and 3370 transitions. [2019-11-28 18:17:40,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:17:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 3370 transitions. [2019-11-28 18:17:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:40,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:40,812 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:17:40,812 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:17:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:17:40,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:40,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668364494] [2019-11-28 18:17:40,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:40,943 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:17:40,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668364494] [2019-11-28 18:17:40,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:40,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:17:40,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550873546] [2019-11-28 18:17:40,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:17:40,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:17:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:17:40,947 INFO L87 Difference]: Start difference. First operand 1484 states and 3370 transitions. Second operand 7 states. [2019-11-28 18:17:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:41,261 INFO L93 Difference]: Finished difference Result 3640 states and 7933 transitions. [2019-11-28 18:17:41,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:17:41,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:17:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:41,270 INFO L225 Difference]: With dead ends: 3640 [2019-11-28 18:17:41,270 INFO L226 Difference]: Without dead ends: 2592 [2019-11-28 18:17:41,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-28 18:17:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2019-11-28 18:17:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1586. [2019-11-28 18:17:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2019-11-28 18:17:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 3554 transitions. [2019-11-28 18:17:41,322 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 3554 transitions. Word has length 52 [2019-11-28 18:17:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:41,323 INFO L462 AbstractCegarLoop]: Abstraction has 1586 states and 3554 transitions. [2019-11-28 18:17:41,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:17:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 3554 transitions. [2019-11-28 18:17:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:41,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:41,328 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:17:41,328 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:17:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1902114364, now seen corresponding path program 2 times [2019-11-28 18:17:41,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:41,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017217511] [2019-11-28 18:17:41,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:41,487 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:17:41,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017217511] [2019-11-28 18:17:41,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:41,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:17:41,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554165806] [2019-11-28 18:17:41,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:17:41,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:17:41,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:17:41,491 INFO L87 Difference]: Start difference. First operand 1586 states and 3554 transitions. Second operand 4 states. [2019-11-28 18:17:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:41,522 INFO L93 Difference]: Finished difference Result 2256 states and 4980 transitions. [2019-11-28 18:17:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:17:41,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:17:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:41,529 INFO L225 Difference]: With dead ends: 2256 [2019-11-28 18:17:41,529 INFO L226 Difference]: Without dead ends: 1944 [2019-11-28 18:17:41,530 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:17:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2019-11-28 18:17:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1521. [2019-11-28 18:17:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-11-28 18:17:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 3411 transitions. [2019-11-28 18:17:41,567 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 3411 transitions. Word has length 52 [2019-11-28 18:17:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:41,567 INFO L462 AbstractCegarLoop]: Abstraction has 1521 states and 3411 transitions. [2019-11-28 18:17:41,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:17:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 3411 transitions. [2019-11-28 18:17:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:41,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:41,572 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:17:41,572 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:17:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 569634058, now seen corresponding path program 1 times [2019-11-28 18:17:41,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:41,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228846781] [2019-11-28 18:17:41,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:41,606 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:17:41,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228846781] [2019-11-28 18:17:41,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:41,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:17:41,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599273640] [2019-11-28 18:17:41,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:17:41,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:17:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:17:41,608 INFO L87 Difference]: Start difference. First operand 1521 states and 3411 transitions. Second operand 3 states. [2019-11-28 18:17:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:41,653 INFO L93 Difference]: Finished difference Result 1864 states and 4058 transitions. [2019-11-28 18:17:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:17:41,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:17:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:41,658 INFO L225 Difference]: With dead ends: 1864 [2019-11-28 18:17:41,658 INFO L226 Difference]: Without dead ends: 1864 [2019-11-28 18:17:41,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:17:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-11-28 18:17:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1543. [2019-11-28 18:17:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2019-11-28 18:17:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 3403 transitions. [2019-11-28 18:17:41,706 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 3403 transitions. Word has length 52 [2019-11-28 18:17:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 1543 states and 3403 transitions. [2019-11-28 18:17:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:17:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 3403 transitions. [2019-11-28 18:17:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:41,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:41,711 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:17:41,711 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:17:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash -320424988, now seen corresponding path program 3 times [2019-11-28 18:17:41,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:41,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226391472] [2019-11-28 18:17:41,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:41,805 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:17:41,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226391472] [2019-11-28 18:17:41,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:41,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:17:41,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691531117] [2019-11-28 18:17:41,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:17:41,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:41,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:17:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:17:41,808 INFO L87 Difference]: Start difference. First operand 1543 states and 3403 transitions. Second operand 5 states. [2019-11-28 18:17:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:41,842 INFO L93 Difference]: Finished difference Result 2271 states and 4944 transitions. [2019-11-28 18:17:41,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:17:41,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:17:41,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:41,845 INFO L225 Difference]: With dead ends: 2271 [2019-11-28 18:17:41,846 INFO L226 Difference]: Without dead ends: 885 [2019-11-28 18:17:41,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:17:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-11-28 18:17:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2019-11-28 18:17:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-28 18:17:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1881 transitions. [2019-11-28 18:17:41,864 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1881 transitions. Word has length 52 [2019-11-28 18:17:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:41,864 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1881 transitions. [2019-11-28 18:17:41,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:17:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1881 transitions. [2019-11-28 18:17:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:41,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:41,867 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:17:41,867 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:17:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 4 times [2019-11-28 18:17:41,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:41,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369519888] [2019-11-28 18:17:41,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:17:42,003 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:17:42,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369519888] [2019-11-28 18:17:42,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:17:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:17:42,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493167614] [2019-11-28 18:17:42,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:17:42,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:17:42,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:17:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:17:42,005 INFO L87 Difference]: Start difference. First operand 885 states and 1881 transitions. Second operand 7 states. [2019-11-28 18:17:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:17:42,175 INFO L93 Difference]: Finished difference Result 1533 states and 3177 transitions. [2019-11-28 18:17:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:17:42,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:17:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:17:42,177 INFO L225 Difference]: With dead ends: 1533 [2019-11-28 18:17:42,178 INFO L226 Difference]: Without dead ends: 1034 [2019-11-28 18:17:42,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:17:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-11-28 18:17:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 861. [2019-11-28 18:17:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-11-28 18:17:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1831 transitions. [2019-11-28 18:17:42,195 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1831 transitions. Word has length 52 [2019-11-28 18:17:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:17:42,195 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1831 transitions. [2019-11-28 18:17:42,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:17:42,196 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1831 transitions. [2019-11-28 18:17:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:17:42,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:17:42,198 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:17:42,198 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:17:42,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:17:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 5 times [2019-11-28 18:17:42,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:17:42,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140031413] [2019-11-28 18:17:42,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:17:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:17:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:17:42,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:17:42,325 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:17:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 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) (= 0 v_~y$flush_delayed~0_22) (= 0 |v_ULTIMATE.start_main_~#t1295~0.offset_27|) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1295~0.base_40|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| 4)) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40|) |v_ULTIMATE.start_main_~#t1295~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #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, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, 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_76|, 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_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1295~0.base=|v_ULTIMATE.start_main_~#t1295~0.base_40|, ULTIMATE.start_main_~#t1295~0.offset=|v_ULTIMATE.start_main_~#t1295~0.offset_27|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #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|, ~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_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~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|, ~__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_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~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, #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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t1296~0.offset, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1295~0.base, ULTIMATE.start_main_~#t1295~0.offset, ULTIMATE.start_main_~#t1296~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__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:17:42,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1296~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13|) |v_ULTIMATE.start_main_~#t1296~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1296~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1296~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| 4) |v_#length_11|)) 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_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1296~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1296~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:17:42,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In-409389829 ~y$r_buff1_thd2~0_Out-409389829) (= ~y$r_buff0_thd1~0_In-409389829 ~y$r_buff1_thd1~0_Out-409389829) (= ~y$r_buff1_thd0~0_Out-409389829 ~y$r_buff0_thd0~0_In-409389829) (= ~__unbuffered_p0_EAX~0_Out-409389829 ~x~0_In-409389829) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829 0)) (= ~y$r_buff0_thd1~0_Out-409389829 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-409389829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-409389829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409389829, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829, ~x~0=~x~0_In-409389829} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-409389829, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-409389829, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-409389829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-409389829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-409389829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409389829, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-409389829, ~x~0=~x~0_In-409389829} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:17:42,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1825618521 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1825618521 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1825618521|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1825618521 |P0Thread1of1ForFork0_#t~ite5_Out1825618521|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1825618521, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1825618521} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1825618521|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825618521, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1825618521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:17:42,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In101267696 256)))) (or (and (= ~y$w_buff0_used~0_In101267696 |P1Thread1of1ForFork1_#t~ite20_Out101267696|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In101267696 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In101267696 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In101267696 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In101267696 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out101267696| |P1Thread1of1ForFork1_#t~ite20_Out101267696|)) (and (= ~y$w_buff0_used~0_In101267696 |P1Thread1of1ForFork1_#t~ite21_Out101267696|) (= |P1Thread1of1ForFork1_#t~ite20_In101267696| |P1Thread1of1ForFork1_#t~ite20_Out101267696|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In101267696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In101267696, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In101267696|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101267696, ~weak$$choice2~0=~weak$$choice2~0_In101267696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In101267696} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In101267696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In101267696, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out101267696|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101267696, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out101267696|, ~weak$$choice2~0=~weak$$choice2~0_In101267696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In101267696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:17:42,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1439767417 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-1439767417 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1439767417| |P1Thread1of1ForFork1_#t~ite23_Out-1439767417|)) (.cse5 (= (mod ~y$w_buff1_used~0_In-1439767417 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1439767417 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1439767417 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1439767417| |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1439767417| ~y$w_buff1_used~0_In-1439767417) (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| |P1Thread1of1ForFork1_#t~ite23_In-1439767417|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| ~y$w_buff1_used~0_In-1439767417) .cse1 (or (and .cse2 .cse3) .cse4 (and .cse3 .cse5))))) (let ((.cse6 (not .cse3))) (and .cse0 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (not .cse4) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (or .cse6 (not .cse5)) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1439767417, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1439767417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1439767417, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1439767417|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1439767417|, ~weak$$choice2~0=~weak$$choice2~0_In-1439767417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1439767417} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1439767417, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1439767417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1439767417, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1439767417|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1439767417|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1439767417|, ~weak$$choice2~0=~weak$$choice2~0_In-1439767417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1439767417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:17:42,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In439842215 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In439842215 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In439842215 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In439842215 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out439842215| ~y$w_buff1_used~0_In439842215)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out439842215| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In439842215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439842215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In439842215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439842215} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out439842215|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In439842215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439842215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In439842215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439842215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:17:42,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In960244872 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out960244872 ~y$r_buff0_thd1~0_In960244872)) (.cse2 (= (mod ~y$w_buff0_used~0_In960244872 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out960244872) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In960244872, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960244872} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In960244872, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out960244872|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out960244872} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:17:42,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1415860930 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1415860930 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1415860930 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1415860930 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1415860930| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1415860930| ~y$r_buff1_thd1~0_In1415860930) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1415860930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1415860930, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1415860930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415860930} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1415860930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1415860930, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1415860930|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1415860930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415860930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:17:42,340 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|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) 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_88} 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_88, 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:17:42,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In369645659 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out369645659| ~y$r_buff1_thd2~0_In369645659) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In369645659 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In369645659 256)) (and (= 0 (mod ~y$w_buff1_used~0_In369645659 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In369645659 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out369645659| |P1Thread1of1ForFork1_#t~ite30_Out369645659|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out369645659| ~y$r_buff1_thd2~0_In369645659) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In369645659| |P1Thread1of1ForFork1_#t~ite29_Out369645659|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In369645659, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In369645659|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In369645659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In369645659, ~weak$$choice2~0=~weak$$choice2~0_In369645659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369645659} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In369645659, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out369645659|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out369645659|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In369645659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In369645659, ~weak$$choice2~0=~weak$$choice2~0_In369645659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369645659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:17:42,340 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:17:42,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1265211570 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1265211570 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1265211570| ~y$w_buff1~0_In1265211570) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1265211570 |P1Thread1of1ForFork1_#t~ite32_Out1265211570|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1265211570, ~y$w_buff1~0=~y$w_buff1~0_In1265211570, ~y~0=~y~0_In1265211570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1265211570} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1265211570, ~y$w_buff1~0=~y$w_buff1~0_In1265211570, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1265211570|, ~y~0=~y~0_In1265211570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1265211570} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:17:42,341 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:17:42,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-551473642 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-551473642 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-551473642|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-551473642| ~y$w_buff0_used~0_In-551473642) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-551473642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-551473642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-551473642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-551473642, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-551473642|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:17:42,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1889565738 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1889565738 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1889565738 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1889565738 256)))) (or (and (= ~y$w_buff1_used~0_In1889565738 |P1Thread1of1ForFork1_#t~ite35_Out1889565738|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1889565738|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1889565738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1889565738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1889565738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1889565738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1889565738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1889565738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1889565738, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1889565738|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1889565738} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:17:42,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1413141706 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1413141706 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1413141706| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1413141706 |P1Thread1of1ForFork1_#t~ite36_Out1413141706|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1413141706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1413141706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1413141706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1413141706, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1413141706|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:17:42,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-327416142 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-327416142 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-327416142 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-327416142 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-327416142|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-327416142 |P1Thread1of1ForFork1_#t~ite37_Out-327416142|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-327416142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-327416142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-327416142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-327416142} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-327416142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-327416142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-327416142, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-327416142|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-327416142} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:17:42,344 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:17:42,345 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:17:42,345 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:17:42,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2130435677 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2130435677 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2130435677| ~y$w_buff1~0_In2130435677) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In2130435677 |ULTIMATE.start_main_#t~ite40_Out2130435677|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2130435677, ~y~0=~y~0_In2130435677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2130435677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130435677} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2130435677|, ~y$w_buff1~0=~y$w_buff1~0_In2130435677, ~y~0=~y~0_In2130435677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2130435677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130435677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:17:42,346 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:17:42,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-305342344 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-305342344 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-305342344|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-305342344 |ULTIMATE.start_main_#t~ite42_Out-305342344|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-305342344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-305342344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-305342344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-305342344, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-305342344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:17:42,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-874001976 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-874001976 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-874001976 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-874001976 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-874001976 |ULTIMATE.start_main_#t~ite43_Out-874001976|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-874001976|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-874001976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-874001976, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-874001976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-874001976} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-874001976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-874001976, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-874001976|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-874001976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-874001976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:17:42,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-687963371 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-687963371 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-687963371|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-687963371 |ULTIMATE.start_main_#t~ite44_Out-687963371|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-687963371, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687963371} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-687963371, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687963371, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-687963371|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:17:42,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1129948064 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1129948064 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1129948064 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1129948064 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1129948064| ~y$r_buff1_thd0~0_In1129948064)) (and (= |ULTIMATE.start_main_#t~ite45_Out1129948064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1129948064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1129948064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1129948064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1129948064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1129948064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1129948064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1129948064, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1129948064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1129948064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:17:42,348 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) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~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:17:42,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:17:42 BasicIcfg [2019-11-28 18:17:42,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:17:42,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:17:42,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:17:42,458 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:17:42,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:28" (3/4) ... [2019-11-28 18:17:42,467 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:17:42,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 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) (= 0 v_~y$flush_delayed~0_22) (= 0 |v_ULTIMATE.start_main_~#t1295~0.offset_27|) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1295~0.base_40|) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| 4)) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_40|) |v_ULTIMATE.start_main_~#t1295~0.offset_27| 0)) |v_#memory_int_17|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #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, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, 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_76|, 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_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1295~0.base=|v_ULTIMATE.start_main_~#t1295~0.base_40|, ULTIMATE.start_main_~#t1295~0.offset=|v_ULTIMATE.start_main_~#t1295~0.offset_27|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #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|, ~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_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~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|, ~__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_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~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, #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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t1296~0.offset, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1295~0.base, ULTIMATE.start_main_~#t1295~0.offset, ULTIMATE.start_main_~#t1296~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__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:17:42,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1296~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13|) |v_ULTIMATE.start_main_~#t1296~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1296~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1296~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| 4) |v_#length_11|)) 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_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1296~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1296~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:17:42,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd2~0_In-409389829 ~y$r_buff1_thd2~0_Out-409389829) (= ~y$r_buff0_thd1~0_In-409389829 ~y$r_buff1_thd1~0_Out-409389829) (= ~y$r_buff1_thd0~0_Out-409389829 ~y$r_buff0_thd0~0_In-409389829) (= ~__unbuffered_p0_EAX~0_Out-409389829 ~x~0_In-409389829) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829 0)) (= ~y$r_buff0_thd1~0_Out-409389829 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-409389829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-409389829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409389829, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829, ~x~0=~x~0_In-409389829} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-409389829, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-409389829, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-409389829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-409389829, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-409389829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-409389829, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-409389829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-409389829, ~x~0=~x~0_In-409389829} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:17:42,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1825618521 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1825618521 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1825618521|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1825618521 |P0Thread1of1ForFork0_#t~ite5_Out1825618521|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1825618521, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1825618521} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1825618521|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1825618521, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1825618521} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:17:42,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In101267696 256)))) (or (and (= ~y$w_buff0_used~0_In101267696 |P1Thread1of1ForFork1_#t~ite20_Out101267696|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In101267696 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In101267696 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In101267696 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In101267696 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out101267696| |P1Thread1of1ForFork1_#t~ite20_Out101267696|)) (and (= ~y$w_buff0_used~0_In101267696 |P1Thread1of1ForFork1_#t~ite21_Out101267696|) (= |P1Thread1of1ForFork1_#t~ite20_In101267696| |P1Thread1of1ForFork1_#t~ite20_Out101267696|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In101267696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In101267696, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In101267696|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101267696, ~weak$$choice2~0=~weak$$choice2~0_In101267696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In101267696} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In101267696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In101267696, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out101267696|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In101267696, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out101267696|, ~weak$$choice2~0=~weak$$choice2~0_In101267696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In101267696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:17:42,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1439767417 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In-1439767417 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1439767417| |P1Thread1of1ForFork1_#t~ite23_Out-1439767417|)) (.cse5 (= (mod ~y$w_buff1_used~0_In-1439767417 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1439767417 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1439767417 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-1439767417| |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-1439767417| ~y$w_buff1_used~0_In-1439767417) (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| |P1Thread1of1ForFork1_#t~ite23_In-1439767417|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| ~y$w_buff1_used~0_In-1439767417) .cse1 (or (and .cse2 .cse3) .cse4 (and .cse3 .cse5))))) (let ((.cse6 (not .cse3))) (and .cse0 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (not .cse4) .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out-1439767417| |P1Thread1of1ForFork1_#t~ite22_Out-1439767417|) (or .cse6 (not .cse5)) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1439767417, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1439767417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1439767417, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1439767417|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1439767417|, ~weak$$choice2~0=~weak$$choice2~0_In-1439767417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1439767417} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1439767417, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1439767417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1439767417, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1439767417|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1439767417|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1439767417|, ~weak$$choice2~0=~weak$$choice2~0_In-1439767417, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1439767417} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:17:42,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In439842215 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In439842215 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In439842215 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In439842215 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out439842215| ~y$w_buff1_used~0_In439842215)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out439842215| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In439842215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439842215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In439842215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439842215} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out439842215|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In439842215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439842215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In439842215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439842215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:17:42,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In960244872 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out960244872 ~y$r_buff0_thd1~0_In960244872)) (.cse2 (= (mod ~y$w_buff0_used~0_In960244872 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out960244872) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In960244872, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In960244872} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In960244872, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out960244872|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out960244872} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:17:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1415860930 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1415860930 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1415860930 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1415860930 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1415860930| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out1415860930| ~y$r_buff1_thd1~0_In1415860930) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1415860930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1415860930, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1415860930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415860930} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1415860930, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1415860930, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1415860930|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1415860930, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1415860930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:17:42,478 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|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) 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_88} 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_88, 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:17:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In369645659 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out369645659| ~y$r_buff1_thd2~0_In369645659) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In369645659 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In369645659 256)) (and (= 0 (mod ~y$w_buff1_used~0_In369645659 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In369645659 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out369645659| |P1Thread1of1ForFork1_#t~ite30_Out369645659|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out369645659| ~y$r_buff1_thd2~0_In369645659) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In369645659| |P1Thread1of1ForFork1_#t~ite29_Out369645659|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In369645659, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In369645659|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In369645659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In369645659, ~weak$$choice2~0=~weak$$choice2~0_In369645659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369645659} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In369645659, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out369645659|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out369645659|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In369645659, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In369645659, ~weak$$choice2~0=~weak$$choice2~0_In369645659, ~y$w_buff1_used~0=~y$w_buff1_used~0_In369645659} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:17:42,478 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:17:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1265211570 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1265211570 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1265211570| ~y$w_buff1~0_In1265211570) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1265211570 |P1Thread1of1ForFork1_#t~ite32_Out1265211570|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1265211570, ~y$w_buff1~0=~y$w_buff1~0_In1265211570, ~y~0=~y~0_In1265211570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1265211570} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1265211570, ~y$w_buff1~0=~y$w_buff1~0_In1265211570, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1265211570|, ~y~0=~y~0_In1265211570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1265211570} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:17:42,479 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:17:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-551473642 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-551473642 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-551473642|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-551473642| ~y$w_buff0_used~0_In-551473642) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-551473642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-551473642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-551473642, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-551473642, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-551473642|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:17:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1889565738 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1889565738 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1889565738 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1889565738 256)))) (or (and (= ~y$w_buff1_used~0_In1889565738 |P1Thread1of1ForFork1_#t~ite35_Out1889565738|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1889565738|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1889565738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1889565738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1889565738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1889565738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1889565738, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1889565738, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1889565738, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1889565738|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1889565738} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:17:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1413141706 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1413141706 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1413141706| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1413141706 |P1Thread1of1ForFork1_#t~ite36_Out1413141706|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1413141706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1413141706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1413141706, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1413141706, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1413141706|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:17:42,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-327416142 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-327416142 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-327416142 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-327416142 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-327416142|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-327416142 |P1Thread1of1ForFork1_#t~ite37_Out-327416142|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-327416142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-327416142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-327416142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-327416142} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-327416142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-327416142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-327416142, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-327416142|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-327416142} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:17:42,481 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:17:42,481 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:17:42,482 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:17:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2130435677 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2130435677 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2130435677| ~y$w_buff1~0_In2130435677) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In2130435677 |ULTIMATE.start_main_#t~ite40_Out2130435677|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2130435677, ~y~0=~y~0_In2130435677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2130435677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130435677} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2130435677|, ~y$w_buff1~0=~y$w_buff1~0_In2130435677, ~y~0=~y~0_In2130435677, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2130435677, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2130435677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:17:42,482 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:17:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-305342344 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-305342344 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-305342344|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-305342344 |ULTIMATE.start_main_#t~ite42_Out-305342344|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-305342344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-305342344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-305342344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-305342344, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-305342344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:17:42,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-874001976 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-874001976 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-874001976 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-874001976 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-874001976 |ULTIMATE.start_main_#t~ite43_Out-874001976|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-874001976|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-874001976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-874001976, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-874001976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-874001976} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-874001976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-874001976, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-874001976|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-874001976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-874001976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:17:42,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-687963371 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-687963371 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-687963371|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-687963371 |ULTIMATE.start_main_#t~ite44_Out-687963371|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-687963371, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687963371} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-687963371, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687963371, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-687963371|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:17:42,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1129948064 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1129948064 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1129948064 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1129948064 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1129948064| ~y$r_buff1_thd0~0_In1129948064)) (and (= |ULTIMATE.start_main_#t~ite45_Out1129948064| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1129948064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1129948064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1129948064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1129948064} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1129948064, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1129948064, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1129948064, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1129948064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1129948064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:17:42,484 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) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~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:17:42,619 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:17:42,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:17:42,624 INFO L168 Benchmark]: Toolchain (without parser) took 15838.48 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -116.6 MB). Peak memory consumption was 312.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:17:42,624 INFO L168 Benchmark]: CDTParser took 0.85 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:17:42,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:17:42,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.17 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:17:42,626 INFO L168 Benchmark]: Boogie Preprocessor took 64.77 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:17:42,627 INFO L168 Benchmark]: RCFGBuilder took 853.75 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:17:42,627 INFO L168 Benchmark]: TraceAbstraction took 13986.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:17:42,627 INFO L168 Benchmark]: Witness Printer took 161.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:17:42,629 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.85 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 667.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.17 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.77 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 853.75 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 13986.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 11.5 GB. * Witness Printer took 161.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 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(&t1295, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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(&t1296, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 x = 1 [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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=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_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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: 13.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1981 SDtfs, 2448 SDslu, 4442 SDs, 0 SdLazy, 2684 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 5665 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 553 ConstructedInterpolants, 0 QuantifiedInterpolants, 105001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...