/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/mix044_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:32:11,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:32:11,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:32:11,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:32:11,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:32:11,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:32:11,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:32:11,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:32:11,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:32:11,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:32:11,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:32:11,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:32:11,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:32:11,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:32:11,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:32:11,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:32:11,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:32:11,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:32:11,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:32:11,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:32:11,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:32:11,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:32:11,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:32:11,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:32:11,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:32:11,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:32:11,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:32:11,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:32:11,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:32:11,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:32:11,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:32:11,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:32:11,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:32:11,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:32:11,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:32:11,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:32:11,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:32:11,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:32:11,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:32:11,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:32:11,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:32:11,576 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 17:32:11,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:32:11,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:32:11,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:32:11,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:32:11,592 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:32:11,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:32:11,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:32:11,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:32:11,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:32:11,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:32:11,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:32:11,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:32:11,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:32:11,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:32:11,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:32:11,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:32:11,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:32:11,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:32:11,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:32:11,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:32:11,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:32:11,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:32:11,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:32:11,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:32:11,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:32:11,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:32:11,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:32:11,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:32:11,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:32:11,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:32:11,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:32:11,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:32:11,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:32:11,913 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:32:11,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-18 17:32:11,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3af457/4dbdb8f1954747aba9b2fcd34b5de4ec/FLAGf41ab5508 [2019-12-18 17:32:12,555 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:32:12,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2019-12-18 17:32:12,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3af457/4dbdb8f1954747aba9b2fcd34b5de4ec/FLAGf41ab5508 [2019-12-18 17:32:12,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3af457/4dbdb8f1954747aba9b2fcd34b5de4ec [2019-12-18 17:32:12,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:32:12,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:32:12,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:32:12,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:32:12,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:32:12,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:32:12" (1/1) ... [2019-12-18 17:32:12,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:12, skipping insertion in model container [2019-12-18 17:32:12,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:32:12" (1/1) ... [2019-12-18 17:32:12,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:32:12,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:32:13,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:32:13,485 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:32:13,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:32:13,638 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:32:13,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13 WrapperNode [2019-12-18 17:32:13,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:32:13,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:32:13,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:32:13,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:32:13,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:32:13,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:32:13,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:32:13,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:32:13,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (1/1) ... [2019-12-18 17:32:13,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:32:13,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:32:13,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:32:13,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:32:13,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (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 17:32:13,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:32:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:32:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:32:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:32:13,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:32:13,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:32:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:32:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:32:13,824 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:32:13,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:32:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:32:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:32:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:32:13,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:32:13,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:32:13,827 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 17:32:14,634 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:32:14,634 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:32:14,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:32:14 BoogieIcfgContainer [2019-12-18 17:32:14,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:32:14,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:32:14,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:32:14,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:32:14,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:32:12" (1/3) ... [2019-12-18 17:32:14,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdd242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:32:14, skipping insertion in model container [2019-12-18 17:32:14,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:13" (2/3) ... [2019-12-18 17:32:14,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdd242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:32:14, skipping insertion in model container [2019-12-18 17:32:14,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:32:14" (3/3) ... [2019-12-18 17:32:14,645 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_tso.opt.i [2019-12-18 17:32:14,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:32:14,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:32:14,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:32:14,669 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:32:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,726 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,742 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,743 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,744 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,783 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,784 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,785 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:32:14,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:32:14,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:32:14,818 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:32:14,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:32:14,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:32:14,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:32:14,819 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:32:14,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:32:14,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:32:14,834 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 17:32:14,836 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:32:14,926 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:32:14,927 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:32:14,943 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:32:14,963 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:32:15,040 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:32:15,040 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:32:15,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:32:15,068 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:32:15,069 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:32:20,335 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 17:32:20,476 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 17:32:20,505 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 17:32:20,505 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 17:32:20,509 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 17:32:23,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 17:32:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 17:32:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:32:23,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:23,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:23,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 17:32:23,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:23,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459854397] [2019-12-18 17:32:23,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:23,779 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 17:32:23,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459854397] [2019-12-18 17:32:23,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:23,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:32:23,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062327379] [2019-12-18 17:32:23,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:23,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:23,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:23,800 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 17:32:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:24,471 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 17:32:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:24,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:32:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:25,883 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 17:32:25,883 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 17:32:25,885 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 17:32:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 17:32:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 17:32:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 17:32:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 17:32:27,420 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 17:32:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:27,421 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 17:32:27,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 17:32:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:32:27,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:27,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:27,429 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:27,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:27,429 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 17:32:27,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:27,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644274603] [2019-12-18 17:32:27,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:27,543 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 17:32:27,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644274603] [2019-12-18 17:32:27,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:27,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:32:27,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134938182] [2019-12-18 17:32:27,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:32:27,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:27,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:32:27,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:32:27,547 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 17:32:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:29,441 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 17:32:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:32:29,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:32:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:29,739 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 17:32:29,739 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 17:32:29,740 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 17:32:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 17:32:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 17:32:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 17:32:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 17:32:32,172 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 17:32:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:32,172 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 17:32:32,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:32:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 17:32:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:32:32,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:32,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:32,176 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:32,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:32,177 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 17:32:32,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:32,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080075673] [2019-12-18 17:32:32,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:32,287 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 17:32:32,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080075673] [2019-12-18 17:32:32,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:32,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:32:32,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105800243] [2019-12-18 17:32:32,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:32,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:32,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:32,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:32,290 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 17:32:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:32,513 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 17:32:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:32,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:32:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:32,639 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 17:32:32,639 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 17:32:32,640 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 17:32:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 17:32:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 17:32:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 17:32:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 17:32:36,219 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 17:32:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:36,219 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 17:32:36,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 17:32:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:32:36,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:36,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:36,223 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 17:32:36,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:36,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773280013] [2019-12-18 17:32:36,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:36,304 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 17:32:36,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773280013] [2019-12-18 17:32:36,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:32:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331945484] [2019-12-18 17:32:36,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:32:36,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:32:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:32:36,306 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 17:32:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:36,402 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 17:32:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:32:36,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:32:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:36,433 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 17:32:36,434 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 17:32:36,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:32:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 17:32:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 17:32:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 17:32:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 17:32:36,746 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 17:32:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:36,746 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 17:32:36,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:32:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 17:32:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:32:36,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:36,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:36,748 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 17:32:36,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:36,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587601988] [2019-12-18 17:32:36,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:36,803 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 17:32:36,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587601988] [2019-12-18 17:32:36,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:36,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:32:36,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742069902] [2019-12-18 17:32:36,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:32:36,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:32:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:32:36,806 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 17:32:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:36,852 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 17:32:36,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:32:36,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:32:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:36,856 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 17:32:36,857 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 17:32:36,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:32:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 17:32:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 17:32:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 17:32:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 17:32:36,905 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 17:32:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 17:32:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:32:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 17:32:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:32:36,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:36,910 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 17:32:36,910 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 17:32:36,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:36,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215730413] [2019-12-18 17:32:36,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:37,018 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 17:32:37,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215730413] [2019-12-18 17:32:37,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:37,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:32:37,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611974062] [2019-12-18 17:32:37,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:32:37,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:32:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:37,020 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 17:32:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:37,075 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 17:32:37,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:32:37,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:32:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:37,078 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 17:32:37,078 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 17:32:37,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 17:32:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 17:32:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 17:32:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 17:32:37,099 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 17:32:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:37,100 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 17:32:37,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:32:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 17:32:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:37,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:37,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:37,105 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 17:32:37,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:37,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592187564] [2019-12-18 17:32:37,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:37,192 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 17:32:37,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592187564] [2019-12-18 17:32:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:32:37,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799655992] [2019-12-18 17:32:37,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:37,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:37,194 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 17:32:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:37,244 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 17:32:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:37,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:32:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:37,247 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:32:37,247 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:32:37,248 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 17:32:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:32:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 17:32:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 17:32:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 17:32:37,264 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 17:32:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:37,264 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 17:32:37,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 17:32:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:37,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:37,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:37,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 17:32:37,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:37,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453991005] [2019-12-18 17:32:37,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:32:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453991005] [2019-12-18 17:32:37,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:37,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:32:37,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100714289] [2019-12-18 17:32:37,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:37,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:37,590 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 17:32:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:37,645 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 17:32:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:37,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:32:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:37,648 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:32:37,648 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:32:37,649 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 17:32:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:32:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 17:32:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 17:32:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 17:32:37,670 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 17:32:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:37,670 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 17:32:37,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 17:32:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:37,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:37,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:37,674 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 17:32:37,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:37,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915832535] [2019-12-18 17:32:37,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:37,816 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 17:32:37,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915832535] [2019-12-18 17:32:37,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:37,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:32:37,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075319990] [2019-12-18 17:32:37,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:32:37,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:32:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:32:37,821 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 17:32:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:38,057 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 17:32:38,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:32:38,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:32:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:38,061 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 17:32:38,061 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 17:32:38,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 17:32:38,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 17:32:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 17:32:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 17:32:38,088 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 17:32:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:38,088 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 17:32:38,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:32:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 17:32:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:38,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:38,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:38,093 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:38,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 17:32:38,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:38,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459226512] [2019-12-18 17:32:38,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:38,191 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 17:32:38,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459226512] [2019-12-18 17:32:38,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:38,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:32:38,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384624831] [2019-12-18 17:32:38,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:32:38,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:32:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:38,193 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 17:32:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:38,569 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 17:32:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:32:38,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:32:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:38,574 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 17:32:38,574 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 17:32:38,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:32:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 17:32:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 17:32:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 17:32:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 17:32:38,604 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 17:32:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:38,604 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 17:32:38,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:32:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 17:32:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:38,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:38,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:38,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 17:32:38,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:38,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188116304] [2019-12-18 17:32:38,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:38,739 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 17:32:38,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188116304] [2019-12-18 17:32:38,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:38,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:32:38,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746607456] [2019-12-18 17:32:38,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:32:38,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:32:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:38,741 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-18 17:32:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:39,093 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-18 17:32:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:32:39,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:32:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:39,097 INFO L225 Difference]: With dead ends: 2377 [2019-12-18 17:32:39,097 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 17:32:39,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:32:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 17:32:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-18 17:32:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-18 17:32:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-18 17:32:39,122 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-18 17:32:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:39,123 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-18 17:32:39,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:32:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-18 17:32:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:32:39,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:39,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:39,129 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-18 17:32:39,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:39,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962168552] [2019-12-18 17:32:39,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:39,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 17:32:39,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962168552] [2019-12-18 17:32:39,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:39,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:32:39,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210650688] [2019-12-18 17:32:39,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:39,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:39,235 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 3 states. [2019-12-18 17:32:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:39,289 INFO L93 Difference]: Finished difference Result 1690 states and 4858 transitions. [2019-12-18 17:32:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:39,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:32:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:39,293 INFO L225 Difference]: With dead ends: 1690 [2019-12-18 17:32:39,293 INFO L226 Difference]: Without dead ends: 1690 [2019-12-18 17:32:39,293 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 17:32:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-12-18 17:32:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1081. [2019-12-18 17:32:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-18 17:32:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-18 17:32:39,316 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 58 [2019-12-18 17:32:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:39,316 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-18 17:32:39,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-18 17:32:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:32:39,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:39,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:39,320 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:39,320 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-18 17:32:39,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:39,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990340189] [2019-12-18 17:32:39,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:39,519 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 17:32:39,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990340189] [2019-12-18 17:32:39,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:39,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:32:39,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843258262] [2019-12-18 17:32:39,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:32:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:32:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:39,523 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 6 states. [2019-12-18 17:32:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:39,590 INFO L93 Difference]: Finished difference Result 1513 states and 4150 transitions. [2019-12-18 17:32:39,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:32:39,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:32:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:39,593 INFO L225 Difference]: With dead ends: 1513 [2019-12-18 17:32:39,594 INFO L226 Difference]: Without dead ends: 951 [2019-12-18 17:32:39,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:32:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-18 17:32:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2019-12-18 17:32:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-18 17:32:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-18 17:32:39,610 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-18 17:32:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:39,611 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-18 17:32:39,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:32:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-18 17:32:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:32:39,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:39,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:39,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 2 times [2019-12-18 17:32:39,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:39,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304322892] [2019-12-18 17:32:39,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:39,769 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 17:32:39,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304322892] [2019-12-18 17:32:39,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:39,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:32:39,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858148356] [2019-12-18 17:32:39,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:32:39,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:32:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:32:39,772 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 6 states. [2019-12-18 17:32:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:39,865 INFO L93 Difference]: Finished difference Result 1371 states and 3700 transitions. [2019-12-18 17:32:39,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:32:39,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:32:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:39,867 INFO L225 Difference]: With dead ends: 1371 [2019-12-18 17:32:39,867 INFO L226 Difference]: Without dead ends: 806 [2019-12-18 17:32:39,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:32:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-18 17:32:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 694. [2019-12-18 17:32:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-18 17:32:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-18 17:32:39,879 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-18 17:32:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:39,880 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-18 17:32:39,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:32:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-18 17:32:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:32:39,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:39,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:39,882 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 3 times [2019-12-18 17:32:39,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:39,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235258091] [2019-12-18 17:32:39,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:40,009 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 17:32:40,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235258091] [2019-12-18 17:32:40,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:40,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:32:40,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051821572] [2019-12-18 17:32:40,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:32:40,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:40,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:32:40,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:32:40,011 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 7 states. [2019-12-18 17:32:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:40,156 INFO L93 Difference]: Finished difference Result 1182 states and 2909 transitions. [2019-12-18 17:32:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:32:40,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 17:32:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:40,157 INFO L225 Difference]: With dead ends: 1182 [2019-12-18 17:32:40,157 INFO L226 Difference]: Without dead ends: 346 [2019-12-18 17:32:40,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:32:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-18 17:32:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 290. [2019-12-18 17:32:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-18 17:32:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-18 17:32:40,163 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-18 17:32:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:40,163 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-18 17:32:40,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:32:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-18 17:32:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:32:40,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:40,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:40,165 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 4 times [2019-12-18 17:32:40,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:40,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94100394] [2019-12-18 17:32:40,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:40,227 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 17:32:40,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94100394] [2019-12-18 17:32:40,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:40,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:32:40,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765636511] [2019-12-18 17:32:40,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:32:40,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:32:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:32:40,433 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-18 17:32:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:40,444 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-18 17:32:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:32:40,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:32:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:40,445 INFO L225 Difference]: With dead ends: 269 [2019-12-18 17:32:40,445 INFO L226 Difference]: Without dead ends: 269 [2019-12-18 17:32:40,446 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 17:32:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-18 17:32:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-18 17:32:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 17:32:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 17:32:40,450 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-18 17:32:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:40,450 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 17:32:40,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:32:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 17:32:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:32:40,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:40,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:40,452 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-18 17:32:40,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:40,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297292403] [2019-12-18 17:32:40,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:32:40,636 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 17:32:40,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297292403] [2019-12-18 17:32:40,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:32:40,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:32:40,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811482254] [2019-12-18 17:32:40,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:32:40,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:32:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:32:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:32:40,639 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 12 states. [2019-12-18 17:32:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:32:40,936 INFO L93 Difference]: Finished difference Result 387 states and 656 transitions. [2019-12-18 17:32:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:32:40,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 17:32:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:32:40,938 INFO L225 Difference]: With dead ends: 387 [2019-12-18 17:32:40,938 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 17:32:40,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:32:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 17:32:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 345. [2019-12-18 17:32:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 17:32:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 17:32:40,945 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 17:32:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:32:40,946 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 17:32:40,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:32:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 17:32:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:32:40,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:32:40,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:32:40,947 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:32:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:32:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 2 times [2019-12-18 17:32:40,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:32:40,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030685111] [2019-12-18 17:32:40,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:32:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:32:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:32:41,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:32:41,056 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:32:41,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff1_thd1~0_233 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1189~0.base_19| 4) |v_#length_29|) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= v_~y~0_38 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1189~0.base_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19|) 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1189~0.base_19|) |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1189~0.offset_16| 0) (= v_~z$r_buff0_thd1~0_87 0) (= v_~x~0_42 0) (= v_~z$w_buff1_used~0_620 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1189~0.base_19| 1) |v_#valid_70|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_21|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_42, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_~#t1189~0.offset=|v_ULTIMATE.start_main_~#t1189~0.offset_16|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_16|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_~#t1189~0.base=|v_ULTIMATE.start_main_~#t1189~0.base_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_22|, ~b~0=v_~b~0_102, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1191~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1192~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1192~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1189~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1191~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1189~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1190~0.base, ~b~0, ULTIMATE.start_main_~#t1190~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:32:41,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13| 1) |v_#valid_48|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1190~0.base_13|) |v_ULTIMATE.start_main_~#t1190~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1190~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1190~0.base_13|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1190~0.base_13|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1190~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1190~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1190~0.base=|v_ULTIMATE.start_main_~#t1190~0.base_13|, ULTIMATE.start_main_~#t1190~0.offset=|v_ULTIMATE.start_main_~#t1190~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1190~0.base, ULTIMATE.start_main_~#t1190~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 17:32:41,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1191~0.offset_10|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1191~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1191~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1191~0.base_12| 0)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1191~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1191~0.base_12|) |v_ULTIMATE.start_main_~#t1191~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1191~0.offset=|v_ULTIMATE.start_main_~#t1191~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1191~0.base=|v_ULTIMATE.start_main_~#t1191~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1191~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1191~0.base, #length] because there is no mapped edge [2019-12-18 17:32:41,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1192~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1192~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1192~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1192~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1192~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1192~0.base_12|) |v_ULTIMATE.start_main_~#t1192~0.offset_10| 3)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1192~0.base=|v_ULTIMATE.start_main_~#t1192~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1192~0.offset=|v_ULTIMATE.start_main_~#t1192~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1192~0.base, ULTIMATE.start_main_~#t1192~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:32:41,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:32:41,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:32:41,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_19) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~x~0_32 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_28} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_28, ~x~0=v_~x~0_32, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:32:41,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-803602528 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-803602528 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-803602528| ~z$w_buff0_used~0_In-803602528)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-803602528| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-803602528, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-803602528} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-803602528, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-803602528, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-803602528|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:32:41,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In382736821 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In382736821 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out382736821| ~z~0_In382736821)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out382736821| ~z$w_buff1~0_In382736821) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In382736821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In382736821, ~z$w_buff1~0=~z$w_buff1~0_In382736821, ~z~0=~z~0_In382736821} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out382736821|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In382736821, ~z$w_buff1_used~0=~z$w_buff1_used~0_In382736821, ~z$w_buff1~0=~z$w_buff1~0_In382736821, ~z~0=~z~0_In382736821} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:32:41,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In1146765646 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1146765646 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1146765646 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1146765646 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1146765646 |P3Thread1of1ForFork3_#t~ite12_Out1146765646|)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1146765646| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1146765646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146765646, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1146765646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146765646} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1146765646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146765646, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1146765646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146765646, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1146765646|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:32:41,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1898791411 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1898791411 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1898791411 0)) (and (= ~z$r_buff0_thd4~0_Out-1898791411 ~z$r_buff0_thd4~0_In-1898791411) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898791411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1898791411} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898791411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1898791411, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1898791411|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:32:41,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1434801258 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1434801258 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1434801258 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1434801258 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1434801258 |P3Thread1of1ForFork3_#t~ite14_Out-1434801258|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-1434801258|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1434801258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434801258, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1434801258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1434801258} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1434801258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434801258, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1434801258|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1434801258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1434801258} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:32:41,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:32:41,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:32:41,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In588765213 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In588765213 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out588765213| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In588765213 |P2Thread1of1ForFork2_#t~ite5_Out588765213|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In588765213, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588765213} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out588765213|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588765213, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588765213} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:32:41,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1842587464 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1842587464 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1842587464 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1842587464 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1842587464 |P2Thread1of1ForFork2_#t~ite6_Out-1842587464|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1842587464|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1842587464, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1842587464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1842587464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1842587464} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1842587464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1842587464, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1842587464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1842587464, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1842587464} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:32:41,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-820392548 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-820392548 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-820392548|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-820392548| ~z$r_buff0_thd3~0_In-820392548)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-820392548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-820392548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-820392548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-820392548, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-820392548|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:32:41,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In424779508 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In424779508 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In424779508 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In424779508 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out424779508| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out424779508| ~z$r_buff1_thd3~0_In424779508) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In424779508, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424779508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424779508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424779508} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In424779508, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In424779508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424779508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In424779508, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out424779508|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:32:41,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:32:41,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:32:41,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1466581601 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1466581601 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1466581601 |ULTIMATE.start_main_#t~ite19_Out1466581601|)) (and (or .cse0 .cse1) (= ~z~0_In1466581601 |ULTIMATE.start_main_#t~ite19_Out1466581601|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1466581601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1466581601, ~z$w_buff1~0=~z$w_buff1~0_In1466581601, ~z~0=~z~0_In1466581601} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1466581601|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1466581601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1466581601, ~z$w_buff1~0=~z$w_buff1~0_In1466581601, ~z~0=~z~0_In1466581601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:32:41,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:32:41,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1634338780 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1634338780 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1634338780| ~z$w_buff0_used~0_In-1634338780)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1634338780| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1634338780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634338780} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1634338780, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634338780, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1634338780|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:32:41,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-770473089 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-770473089 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-770473089 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-770473089 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite22_Out-770473089| ~z$w_buff1_used~0_In-770473089)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-770473089| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-770473089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-770473089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-770473089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770473089} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-770473089, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-770473089, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-770473089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-770473089, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-770473089|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:32:41,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1815841135 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1815841135 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1815841135 |ULTIMATE.start_main_#t~ite23_Out-1815841135|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1815841135| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1815841135, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1815841135} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1815841135, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1815841135, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1815841135|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:32:41,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In229561743 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In229561743 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In229561743 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In229561743 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out229561743| ~z$r_buff1_thd0~0_In229561743) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out229561743| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In229561743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229561743, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In229561743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229561743} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In229561743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229561743, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In229561743, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out229561743|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229561743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:32:41,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In881829664 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In881829664| |ULTIMATE.start_main_#t~ite39_Out881829664|) (= ~z$w_buff1_used~0_In881829664 |ULTIMATE.start_main_#t~ite40_Out881829664|)) (and (= |ULTIMATE.start_main_#t~ite39_Out881829664| |ULTIMATE.start_main_#t~ite40_Out881829664|) (= ~z$w_buff1_used~0_In881829664 |ULTIMATE.start_main_#t~ite39_Out881829664|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In881829664 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In881829664 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In881829664 256) 0)) (and (= (mod ~z$r_buff1_thd0~0_In881829664 256) 0) .cse1))) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In881829664, ~z$w_buff0_used~0=~z$w_buff0_used~0_In881829664, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In881829664|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In881829664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In881829664, ~weak$$choice2~0=~weak$$choice2~0_In881829664} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In881829664, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out881829664|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out881829664|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In881829664, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In881829664, ~z$w_buff1_used~0=~z$w_buff1_used~0_In881829664, ~weak$$choice2~0=~weak$$choice2~0_In881829664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:32:41,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:32:41,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1622539121 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In1622539121 |ULTIMATE.start_main_#t~ite46_Out1622539121|) (= |ULTIMATE.start_main_#t~ite45_In1622539121| |ULTIMATE.start_main_#t~ite45_Out1622539121|) (not .cse0)) (and (= ~z$r_buff1_thd0~0_In1622539121 |ULTIMATE.start_main_#t~ite45_Out1622539121|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1622539121 256)))) (or (= (mod ~z$w_buff0_used~0_In1622539121 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1622539121 256) 0)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1622539121 256))))) (= |ULTIMATE.start_main_#t~ite45_Out1622539121| |ULTIMATE.start_main_#t~ite46_Out1622539121|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1622539121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1622539121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1622539121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1622539121, ~weak$$choice2~0=~weak$$choice2~0_In1622539121, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1622539121|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1622539121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1622539121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1622539121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1622539121, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1622539121|, ~weak$$choice2~0=~weak$$choice2~0_In1622539121, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1622539121|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:32:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:32:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:32:41,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:32:41 BasicIcfg [2019-12-18 17:32:41,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:32:41,182 INFO L168 Benchmark]: Toolchain (without parser) took 28293.09 ms. Allocated memory was 143.1 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 99.6 MB in the beginning and 802.5 MB in the end (delta: -703.0 MB). Peak memory consumption was 685.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,183 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.93 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.2 MB in the beginning and 151.4 MB in the end (delta: -52.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.35 ms. Allocated memory is still 199.8 MB. Free memory was 151.4 MB in the beginning and 147.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,189 INFO L168 Benchmark]: Boogie Preprocessor took 38.87 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 145.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,193 INFO L168 Benchmark]: RCFGBuilder took 891.78 ms. Allocated memory is still 199.8 MB. Free memory was 145.7 MB in the beginning and 95.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,193 INFO L168 Benchmark]: TraceAbstraction took 26543.32 ms. Allocated memory was 199.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.6 MB in the beginning and 802.5 MB in the end (delta: -707.0 MB). Peak memory consumption was 625.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:32:41,200 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.22 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.93 ms. Allocated memory was 143.1 MB in the beginning and 199.8 MB in the end (delta: 56.6 MB). Free memory was 99.2 MB in the beginning and 151.4 MB in the end (delta: -52.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.35 ms. Allocated memory is still 199.8 MB. Free memory was 151.4 MB in the beginning and 147.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.87 ms. Allocated memory is still 199.8 MB. Free memory was 147.8 MB in the beginning and 145.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.78 ms. Allocated memory is still 199.8 MB. Free memory was 145.7 MB in the beginning and 95.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26543.32 ms. Allocated memory was 199.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 95.6 MB in the beginning and 802.5 MB in the end (delta: -707.0 MB). Peak memory consumption was 625.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1869 SDtfs, 1765 SDslu, 3816 SDs, 0 SdLazy, 1358 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 7752 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 128731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...