/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:07:27,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:07:27,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:07:27,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:07:27,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:07:27,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:07:27,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:07:27,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:07:27,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:07:27,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:07:27,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:07:27,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:07:27,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:07:27,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:07:27,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:07:27,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:07:27,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:07:27,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:07:27,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:07:27,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:07:27,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:07:27,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:07:27,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:07:27,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:07:27,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:07:27,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:07:27,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:07:27,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:07:27,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:07:27,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:07:27,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:07:27,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:07:27,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:07:27,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:07:27,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:07:27,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:07:27,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:07:27,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:07:27,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:07:27,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:07:27,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:07:27,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:07:27,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:07:27,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:07:27,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:07:27,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:07:27,536 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:07:27,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:07:27,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:07:27,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:07:27,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:07:27,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:07:27,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:07:27,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:07:27,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:07:27,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:07:27,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:07:27,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:07:27,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:07:27,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:07:27,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:07:27,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:07:27,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:07:27,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:07:27,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:07:27,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:07:27,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:07:27,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:07:27,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:07:27,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:07:27,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:07:27,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:07:27,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:07:27,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:07:27,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:07:27,821 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:07:27,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-18 19:07:27,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d887f29/b9818c1059a446ad8a42c5f23c57d5e9/FLAGa851813eb [2019-12-18 19:07:28,514 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:07:28,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-18 19:07:28,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d887f29/b9818c1059a446ad8a42c5f23c57d5e9/FLAGa851813eb [2019-12-18 19:07:28,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d887f29/b9818c1059a446ad8a42c5f23c57d5e9 [2019-12-18 19:07:28,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:07:28,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:07:28,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:07:28,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:07:28,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:07:28,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:07:28" (1/1) ... [2019-12-18 19:07:28,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552386f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:28, skipping insertion in model container [2019-12-18 19:07:28,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:07:28" (1/1) ... [2019-12-18 19:07:28,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:07:28,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:07:29,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:07:29,437 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:07:29,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:07:29,584 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:07:29,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29 WrapperNode [2019-12-18 19:07:29,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:07:29,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:07:29,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:07:29,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:07:29,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:07:29,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:07:29,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:07:29,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:07:29,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (1/1) ... [2019-12-18 19:07:29,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:07:29,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:07:29,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:07:29,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:07:29,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (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-12-18 19:07:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:07:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:07:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:07:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:07:29,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:07:29,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:07:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:07:29,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:07:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:07:29,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:07:29,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:07:29,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:07:29,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:07:29,762 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:07:30,480 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:07:30,480 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:07:30,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:07:30 BoogieIcfgContainer [2019-12-18 19:07:30,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:07:30,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:07:30,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:07:30,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:07:30,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:07:28" (1/3) ... [2019-12-18 19:07:30,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac3c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:07:30, skipping insertion in model container [2019-12-18 19:07:30,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:07:29" (2/3) ... [2019-12-18 19:07:30,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac3c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:07:30, skipping insertion in model container [2019-12-18 19:07:30,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:07:30" (3/3) ... [2019-12-18 19:07:30,491 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-12-18 19:07:30,501 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:07:30,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:07:30,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:07:30,512 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:07:30,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,553 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,555 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,580 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,580 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,580 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,581 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,581 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,592 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,592 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,598 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,622 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:07:30,638 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:07:30,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:07:30,659 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:07:30,659 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:07:30,659 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:07:30,659 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:07:30,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:07:30,660 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:07:30,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:07:30,677 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 19:07:30,679 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 19:07:30,754 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 19:07:30,755 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:07:30,771 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 19:07:30,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 19:07:30,830 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 19:07:30,831 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:07:30,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 19:07:30,851 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 19:07:30,852 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:07:35,562 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 19:07:35,692 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 19:07:35,911 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-18 19:07:35,911 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 19:07:35,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-18 19:07:36,849 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-18 19:07:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-18 19:07:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:07:36,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:36,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:36,859 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:36,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:36,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-18 19:07:36,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:36,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003435609] [2019-12-18 19:07:36,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:37,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003435609] [2019-12-18 19:07:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:07:37,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883471371] [2019-12-18 19:07:37,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:37,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:37,161 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-18 19:07:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:37,564 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-18 19:07:37,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:37,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:07:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:37,737 INFO L225 Difference]: With dead ends: 13722 [2019-12-18 19:07:37,737 INFO L226 Difference]: Without dead ends: 12214 [2019-12-18 19:07:37,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-18 19:07:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-18 19:07:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-18 19:07:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-18 19:07:38,460 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-18 19:07:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:38,461 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-18 19:07:38,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-18 19:07:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:07:38,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:38,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:38,468 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-18 19:07:38,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:38,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608391353] [2019-12-18 19:07:38,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:38,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608391353] [2019-12-18 19:07:38,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:38,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:38,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277816282] [2019-12-18 19:07:38,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:07:38,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:38,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:07:38,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:07:38,597 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-18 19:07:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:38,805 INFO L93 Difference]: Finished difference Result 8152 states and 27171 transitions. [2019-12-18 19:07:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:07:38,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:07:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:38,871 INFO L225 Difference]: With dead ends: 8152 [2019-12-18 19:07:38,871 INFO L226 Difference]: Without dead ends: 7398 [2019-12-18 19:07:38,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2019-12-18 19:07:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7398. [2019-12-18 19:07:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7398 states. [2019-12-18 19:07:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7398 states to 7398 states and 24654 transitions. [2019-12-18 19:07:39,992 INFO L78 Accepts]: Start accepts. Automaton has 7398 states and 24654 transitions. Word has length 13 [2019-12-18 19:07:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:39,992 INFO L462 AbstractCegarLoop]: Abstraction has 7398 states and 24654 transitions. [2019-12-18 19:07:39,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:07:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7398 states and 24654 transitions. [2019-12-18 19:07:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:07:40,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:40,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:40,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1403843805, now seen corresponding path program 1 times [2019-12-18 19:07:40,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:40,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443173990] [2019-12-18 19:07:40,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:40,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443173990] [2019-12-18 19:07:40,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:40,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:07:40,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646392758] [2019-12-18 19:07:40,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:07:40,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:07:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:40,135 INFO L87 Difference]: Start difference. First operand 7398 states and 24654 transitions. Second operand 5 states. [2019-12-18 19:07:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:40,220 INFO L93 Difference]: Finished difference Result 2255 states and 6311 transitions. [2019-12-18 19:07:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:07:40,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 19:07:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:40,226 INFO L225 Difference]: With dead ends: 2255 [2019-12-18 19:07:40,227 INFO L226 Difference]: Without dead ends: 1825 [2019-12-18 19:07:40,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-12-18 19:07:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1783. [2019-12-18 19:07:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2019-12-18 19:07:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 4825 transitions. [2019-12-18 19:07:40,271 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 4825 transitions. Word has length 14 [2019-12-18 19:07:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:40,272 INFO L462 AbstractCegarLoop]: Abstraction has 1783 states and 4825 transitions. [2019-12-18 19:07:40,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:07:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 4825 transitions. [2019-12-18 19:07:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:07:40,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:40,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:07:40,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-18 19:07:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:40,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182759877] [2019-12-18 19:07:40,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:40,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182759877] [2019-12-18 19:07:40,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:40,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:40,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612838327] [2019-12-18 19:07:40,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:07:40,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:07:40,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:40,396 INFO L87 Difference]: Start difference. First operand 1783 states and 4825 transitions. Second operand 5 states. [2019-12-18 19:07:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:40,661 INFO L93 Difference]: Finished difference Result 2780 states and 7260 transitions. [2019-12-18 19:07:40,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:07:40,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 19:07:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:40,669 INFO L225 Difference]: With dead ends: 2780 [2019-12-18 19:07:40,670 INFO L226 Difference]: Without dead ends: 2718 [2019-12-18 19:07:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-18 19:07:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2238. [2019-12-18 19:07:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2019-12-18 19:07:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 5949 transitions. [2019-12-18 19:07:40,733 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 5949 transitions. Word has length 16 [2019-12-18 19:07:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:40,733 INFO L462 AbstractCegarLoop]: Abstraction has 2238 states and 5949 transitions. [2019-12-18 19:07:40,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:07:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 5949 transitions. [2019-12-18 19:07:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:40,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:40,738 INFO L411 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] [2019-12-18 19:07:40,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -73533850, now seen corresponding path program 1 times [2019-12-18 19:07:40,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:40,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18635895] [2019-12-18 19:07:40,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:40,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-12-18 19:07:40,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18635895] [2019-12-18 19:07:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:07:40,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827725720] [2019-12-18 19:07:40,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:40,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:40,843 INFO L87 Difference]: Start difference. First operand 2238 states and 5949 transitions. Second operand 3 states. [2019-12-18 19:07:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:40,865 INFO L93 Difference]: Finished difference Result 3544 states and 9097 transitions. [2019-12-18 19:07:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:40,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 19:07:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:40,872 INFO L225 Difference]: With dead ends: 3544 [2019-12-18 19:07:40,873 INFO L226 Difference]: Without dead ends: 2260 [2019-12-18 19:07:40,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-18 19:07:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 2228. [2019-12-18 19:07:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-12-18 19:07:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 5854 transitions. [2019-12-18 19:07:40,927 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 5854 transitions. Word has length 29 [2019-12-18 19:07:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:40,927 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 5854 transitions. [2019-12-18 19:07:40,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 5854 transitions. [2019-12-18 19:07:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:40,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:40,933 INFO L411 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] [2019-12-18 19:07:40,933 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:40,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-18 19:07:40,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:40,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492428728] [2019-12-18 19:07:40,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:41,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492428728] [2019-12-18 19:07:41,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:41,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:41,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63844661] [2019-12-18 19:07:41,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:41,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:41,011 INFO L87 Difference]: Start difference. First operand 2228 states and 5854 transitions. Second operand 3 states. [2019-12-18 19:07:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:41,070 INFO L93 Difference]: Finished difference Result 3205 states and 8162 transitions. [2019-12-18 19:07:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:41,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 19:07:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:41,079 INFO L225 Difference]: With dead ends: 3205 [2019-12-18 19:07:41,079 INFO L226 Difference]: Without dead ends: 3205 [2019-12-18 19:07:41,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2019-12-18 19:07:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2441. [2019-12-18 19:07:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-18 19:07:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 6277 transitions. [2019-12-18 19:07:41,138 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 6277 transitions. Word has length 29 [2019-12-18 19:07:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:41,139 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 6277 transitions. [2019-12-18 19:07:41,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 6277 transitions. [2019-12-18 19:07:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:41,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:41,144 INFO L411 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] [2019-12-18 19:07:41,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-18 19:07:41,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:41,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127164375] [2019-12-18 19:07:41,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:41,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127164375] [2019-12-18 19:07:41,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:41,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:07:41,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225313776] [2019-12-18 19:07:41,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:07:41,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:41,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:07:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:07:41,269 INFO L87 Difference]: Start difference. First operand 2441 states and 6277 transitions. Second operand 6 states. [2019-12-18 19:07:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:41,666 INFO L93 Difference]: Finished difference Result 3417 states and 8518 transitions. [2019-12-18 19:07:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:07:41,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 19:07:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:41,676 INFO L225 Difference]: With dead ends: 3417 [2019-12-18 19:07:41,676 INFO L226 Difference]: Without dead ends: 3409 [2019-12-18 19:07:41,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:07:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-12-18 19:07:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 2495. [2019-12-18 19:07:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2019-12-18 19:07:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6391 transitions. [2019-12-18 19:07:41,736 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6391 transitions. Word has length 29 [2019-12-18 19:07:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 2495 states and 6391 transitions. [2019-12-18 19:07:41,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:07:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6391 transitions. [2019-12-18 19:07:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 19:07:41,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:41,743 INFO L411 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] [2019-12-18 19:07:41,744 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash -851988572, now seen corresponding path program 2 times [2019-12-18 19:07:41,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:41,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988054208] [2019-12-18 19:07:41,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:41,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988054208] [2019-12-18 19:07:41,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:41,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:07:41,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785874160] [2019-12-18 19:07:41,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:07:41,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:07:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:07:41,826 INFO L87 Difference]: Start difference. First operand 2495 states and 6391 transitions. Second operand 5 states. [2019-12-18 19:07:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:42,177 INFO L93 Difference]: Finished difference Result 3607 states and 9171 transitions. [2019-12-18 19:07:42,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:07:42,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 19:07:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:42,186 INFO L225 Difference]: With dead ends: 3607 [2019-12-18 19:07:42,187 INFO L226 Difference]: Without dead ends: 3607 [2019-12-18 19:07:42,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-18 19:07:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-18 19:07:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3121. [2019-12-18 19:07:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2019-12-18 19:07:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 8015 transitions. [2019-12-18 19:07:42,253 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 8015 transitions. Word has length 29 [2019-12-18 19:07:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:42,254 INFO L462 AbstractCegarLoop]: Abstraction has 3121 states and 8015 transitions. [2019-12-18 19:07:42,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:07:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 8015 transitions. [2019-12-18 19:07:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 19:07:42,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:42,261 INFO L411 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] [2019-12-18 19:07:42,262 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:42,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 1 times [2019-12-18 19:07:42,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:42,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997464451] [2019-12-18 19:07:42,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:42,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997464451] [2019-12-18 19:07:42,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:42,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:07:42,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978044198] [2019-12-18 19:07:42,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:07:42,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:42,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:07:42,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:07:42,349 INFO L87 Difference]: Start difference. First operand 3121 states and 8015 transitions. Second operand 6 states. [2019-12-18 19:07:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:42,437 INFO L93 Difference]: Finished difference Result 2181 states and 5651 transitions. [2019-12-18 19:07:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:07:42,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-18 19:07:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:42,442 INFO L225 Difference]: With dead ends: 2181 [2019-12-18 19:07:42,443 INFO L226 Difference]: Without dead ends: 1908 [2019-12-18 19:07:42,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:07:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-12-18 19:07:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1704. [2019-12-18 19:07:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 19:07:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 4474 transitions. [2019-12-18 19:07:42,477 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 4474 transitions. Word has length 30 [2019-12-18 19:07:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:42,477 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 4474 transitions. [2019-12-18 19:07:42,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:07:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 4474 transitions. [2019-12-18 19:07:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 19:07:42,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:42,482 INFO L411 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] [2019-12-18 19:07:42,482 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1320030082, now seen corresponding path program 1 times [2019-12-18 19:07:42,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:42,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865461385] [2019-12-18 19:07:42,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:42,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865461385] [2019-12-18 19:07:42,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:42,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:07:42,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801921164] [2019-12-18 19:07:42,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:42,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:42,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:42,527 INFO L87 Difference]: Start difference. First operand 1704 states and 4474 transitions. Second operand 3 states. [2019-12-18 19:07:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:42,575 INFO L93 Difference]: Finished difference Result 2010 states and 5065 transitions. [2019-12-18 19:07:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:42,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 19:07:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:42,579 INFO L225 Difference]: With dead ends: 2010 [2019-12-18 19:07:42,579 INFO L226 Difference]: Without dead ends: 2010 [2019-12-18 19:07:42,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2019-12-18 19:07:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1726. [2019-12-18 19:07:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-18 19:07:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4407 transitions. [2019-12-18 19:07:42,613 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4407 transitions. Word has length 44 [2019-12-18 19:07:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:42,613 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 4407 transitions. [2019-12-18 19:07:42,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4407 transitions. [2019-12-18 19:07:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 19:07:42,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:42,618 INFO L411 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] [2019-12-18 19:07:42,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2025793648, now seen corresponding path program 1 times [2019-12-18 19:07:42,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:42,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369928637] [2019-12-18 19:07:42,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:42,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369928637] [2019-12-18 19:07:42,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:42,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:07:42,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625704238] [2019-12-18 19:07:42,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:07:42,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:42,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:07:42,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:07:42,727 INFO L87 Difference]: Start difference. First operand 1726 states and 4407 transitions. Second operand 7 states. [2019-12-18 19:07:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:42,997 INFO L93 Difference]: Finished difference Result 4424 states and 11090 transitions. [2019-12-18 19:07:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:07:42,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 19:07:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:43,003 INFO L225 Difference]: With dead ends: 4424 [2019-12-18 19:07:43,003 INFO L226 Difference]: Without dead ends: 2848 [2019-12-18 19:07:43,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:07:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2019-12-18 19:07:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1820. [2019-12-18 19:07:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-12-18 19:07:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4610 transitions. [2019-12-18 19:07:43,080 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4610 transitions. Word has length 44 [2019-12-18 19:07:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:43,080 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4610 transitions. [2019-12-18 19:07:43,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:07:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4610 transitions. [2019-12-18 19:07:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 19:07:43,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:43,086 INFO L411 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] [2019-12-18 19:07:43,087 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1245082224, now seen corresponding path program 2 times [2019-12-18 19:07:43,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:43,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795833758] [2019-12-18 19:07:43,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:07:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:07:43,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795833758] [2019-12-18 19:07:43,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:07:43,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:07:43,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280122741] [2019-12-18 19:07:43,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:07:43,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:07:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:07:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:43,235 INFO L87 Difference]: Start difference. First operand 1820 states and 4610 transitions. Second operand 3 states. [2019-12-18 19:07:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:07:43,255 INFO L93 Difference]: Finished difference Result 1818 states and 4605 transitions. [2019-12-18 19:07:43,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:07:43,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 19:07:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:07:43,260 INFO L225 Difference]: With dead ends: 1818 [2019-12-18 19:07:43,260 INFO L226 Difference]: Without dead ends: 1818 [2019-12-18 19:07:43,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:07:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-12-18 19:07:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1560. [2019-12-18 19:07:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-12-18 19:07:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 4006 transitions. [2019-12-18 19:07:43,302 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 4006 transitions. Word has length 44 [2019-12-18 19:07:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:07:43,303 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 4006 transitions. [2019-12-18 19:07:43,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:07:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 4006 transitions. [2019-12-18 19:07:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 19:07:43,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:07:43,309 INFO L411 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] [2019-12-18 19:07:43,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:07:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:07:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 1 times [2019-12-18 19:07:43,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:07:43,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650405471] [2019-12-18 19:07:43,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:07:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:07:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:07:43,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:07:43,548 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:07:43,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31| 1) |v_#valid_66|) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31|) |v_ULTIMATE.start_main_~#t2577~0.offset_22| 0)) |v_#memory_int_23|) (= v_~z~0_143 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31|) 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2577~0.base_31|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_31| 4)) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_22|) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_22|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_31|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_31|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:07:43,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-12-18 19:07:43,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 19:07:43,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= 0 (mod v_~y$w_buff1_used~0_71 256)) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_16) (= v_P2Thread1of1ForFork2_~arg.offset_16 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| 1) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_16, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_16, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:07:43,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 19:07:43,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1755852965 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1755852965 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1755852965 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1755852965 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In1755852965 256) 0) .cse1))) (= ~y$w_buff0~0_In1755852965 |P1Thread1of1ForFork1_#t~ite8_Out1755852965|) (= |P1Thread1of1ForFork1_#t~ite8_Out1755852965| |P1Thread1of1ForFork1_#t~ite9_Out1755852965|)) (and (= ~y$w_buff0~0_In1755852965 |P1Thread1of1ForFork1_#t~ite9_Out1755852965|) (= |P1Thread1of1ForFork1_#t~ite8_In1755852965| |P1Thread1of1ForFork1_#t~ite8_Out1755852965|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1755852965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1755852965, ~y$w_buff0~0=~y$w_buff0~0_In1755852965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1755852965, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1755852965|, ~weak$$choice2~0=~weak$$choice2~0_In1755852965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1755852965} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1755852965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1755852965, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1755852965|, ~y$w_buff0~0=~y$w_buff0~0_In1755852965, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1755852965, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1755852965|, ~weak$$choice2~0=~weak$$choice2~0_In1755852965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1755852965} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 19:07:43,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1299666196 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In1299666196 |P1Thread1of1ForFork1_#t~ite15_Out1299666196|) (= |P1Thread1of1ForFork1_#t~ite14_In1299666196| |P1Thread1of1ForFork1_#t~ite14_Out1299666196|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1299666196 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In1299666196 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1299666196 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1299666196 256) 0)))) (= ~y$w_buff0_used~0_In1299666196 |P1Thread1of1ForFork1_#t~ite14_Out1299666196|) (= |P1Thread1of1ForFork1_#t~ite14_Out1299666196| |P1Thread1of1ForFork1_#t~ite15_Out1299666196|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299666196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299666196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299666196, ~weak$$choice2~0=~weak$$choice2~0_In1299666196, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1299666196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299666196} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299666196, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299666196, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299666196, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1299666196|, ~weak$$choice2~0=~weak$$choice2~0_In1299666196, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1299666196|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299666196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:07:43,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 19:07:43,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-722090431 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-722090431 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-722090431| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-722090431 |P2Thread1of1ForFork2_#t~ite28_Out-722090431|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-722090431, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-722090431} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-722090431, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-722090431, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-722090431|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 19:07:43,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 19:07:43,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1440402142 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1440402142 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1440402142 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1440402142 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out1440402142| ~y$w_buff1_used~0_In1440402142) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out1440402142| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1440402142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1440402142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1440402142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1440402142} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1440402142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1440402142, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1440402142, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1440402142|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1440402142} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 19:07:43,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1834246155 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1834246155 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1834246155)) (and (= ~y$r_buff0_thd3~0_In-1834246155 ~y$r_buff0_thd3~0_Out-1834246155) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834246155, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1834246155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1834246155, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1834246155|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1834246155} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 19:07:43,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1664175781 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1664175781 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1664175781 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1664175781 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1664175781 |P2Thread1of1ForFork2_#t~ite31_Out-1664175781|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1664175781|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1664175781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664175781, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1664175781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664175781} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1664175781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664175781, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1664175781|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1664175781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664175781} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 19:07:43,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_38| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_37|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 19:07:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:07:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-161894355 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-161894355 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-161894355| ~y~0_In-161894355)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-161894355| ~y$w_buff1~0_In-161894355)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-161894355, ~y~0=~y~0_In-161894355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-161894355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-161894355} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-161894355, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-161894355|, ~y~0=~y~0_In-161894355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-161894355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-161894355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 19:07:43,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 19:07:43,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2044655244 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2044655244 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2044655244 |ULTIMATE.start_main_#t~ite37_Out-2044655244|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2044655244|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2044655244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2044655244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2044655244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2044655244, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2044655244|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 19:07:43,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In402407282 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In402407282 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In402407282 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In402407282 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out402407282| ~y$w_buff1_used~0_In402407282) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out402407282| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In402407282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In402407282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In402407282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In402407282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In402407282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In402407282, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out402407282|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In402407282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In402407282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 19:07:43,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-518694197 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-518694197 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-518694197 |ULTIMATE.start_main_#t~ite39_Out-518694197|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out-518694197|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-518694197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-518694197} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-518694197, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-518694197|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-518694197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 19:07:43,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In312747798 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In312747798 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In312747798 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In312747798 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out312747798| ~y$r_buff1_thd0~0_In312747798) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out312747798| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In312747798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In312747798, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In312747798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312747798} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out312747798|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In312747798, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In312747798, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In312747798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In312747798} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 19:07:43,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:07:43,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:07:43 BasicIcfg [2019-12-18 19:07:43,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:07:43,699 INFO L168 Benchmark]: Toolchain (without parser) took 14934.17 ms. Allocated memory was 145.8 MB in the beginning and 647.0 MB in the end (delta: 501.2 MB). Free memory was 101.8 MB in the beginning and 407.4 MB in the end (delta: -305.6 MB). Peak memory consumption was 195.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,700 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.04 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 158.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,702 INFO L168 Benchmark]: Boogie Preprocessor took 41.68 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,703 INFO L168 Benchmark]: RCFGBuilder took 791.68 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 109.5 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,703 INFO L168 Benchmark]: TraceAbstraction took 13208.40 ms. Allocated memory was 203.4 MB in the beginning and 647.0 MB in the end (delta: 443.5 MB). Free memory was 109.5 MB in the beginning and 407.4 MB in the end (delta: -297.9 MB). Peak memory consumption was 145.7 MB. Max. memory is 7.1 GB. [2019-12-18 19:07:43,712 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.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.04 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 158.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.68 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.68 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 109.5 MB in the end (delta: 43.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13208.40 ms. Allocated memory was 203.4 MB in the beginning and 647.0 MB in the end (delta: 443.5 MB). Free memory was 109.5 MB in the beginning and 407.4 MB in the end (delta: -297.9 MB). Peak memory consumption was 145.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? 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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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) [L756] 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)) [L757] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L757] 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)) [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 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 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1377 SDtfs, 1666 SDslu, 2476 SDs, 0 SdLazy, 953 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14042occurred 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: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 4492 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 49462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...