/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:35:56,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:35:56,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:35:56,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:35:56,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:35:56,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:35:56,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:35:56,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:35:56,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:35:56,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:35:56,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:35:56,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:35:56,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:35:56,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:35:56,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:35:56,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:35:56,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:35:56,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:35:56,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:35:56,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:35:56,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:35:56,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:35:56,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:35:56,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:35:56,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:35:56,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:35:56,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:35:56,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:35:56,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:35:56,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:35:56,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:35:56,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:35:56,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:35:56,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:35:56,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:35:56,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:35:56,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:35:56,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:35:56,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:35:56,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:35:56,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:35:56,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 00:35:56,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:35:56,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:35:56,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:35:56,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:35:56,543 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:35:56,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:35:56,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:35:56,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:35:56,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:35:56,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:35:56,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:35:56,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:35:56,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:35:56,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:35:56,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:35:56,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:35:56,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:35:56,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:35:56,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:35:56,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:35:56,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:35:56,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:35:56,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:35:56,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:35:56,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:35:56,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:35:56,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:35:56,549 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:35:56,549 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:35:56,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:35:56,551 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:35:56,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:35:56,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:35:56,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:35:56,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:35:56,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:35:56,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:35:56,860 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-28 00:35:56,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcf344fc/4466c34a141b457bbe7f524179b86273/FLAG36ce898fc [2019-12-28 00:35:57,506 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:35:57,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-28 00:35:57,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcf344fc/4466c34a141b457bbe7f524179b86273/FLAG36ce898fc [2019-12-28 00:35:57,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fcf344fc/4466c34a141b457bbe7f524179b86273 [2019-12-28 00:35:57,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:35:57,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:35:57,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:35:57,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:35:57,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:35:57,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:35:57" (1/1) ... [2019-12-28 00:35:57,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cef981d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:57, skipping insertion in model container [2019-12-28 00:35:57,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:35:57" (1/1) ... [2019-12-28 00:35:57,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:35:57,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:35:58,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:35:58,472 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:35:58,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:35:58,612 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:35:58,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58 WrapperNode [2019-12-28 00:35:58,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:35:58,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:35:58,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:35:58,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:35:58,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:35:58,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:35:58,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:35:58,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:35:58,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (1/1) ... [2019-12-28 00:35:58,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:35:58,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:35:58,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:35:58,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:35:58,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (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-28 00:35:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:35:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:35:58,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:35:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:35:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:35:58,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:35:58,800 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:35:58,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:35:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:35:58,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:35:58,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:35:58,803 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 00:35:59,468 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:35:59,468 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:35:59,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:35:59 BoogieIcfgContainer [2019-12-28 00:35:59,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:35:59,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:35:59,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:35:59,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:35:59,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:35:57" (1/3) ... [2019-12-28 00:35:59,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ad3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:35:59, skipping insertion in model container [2019-12-28 00:35:59,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:35:58" (2/3) ... [2019-12-28 00:35:59,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477ad3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:35:59, skipping insertion in model container [2019-12-28 00:35:59,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:35:59" (3/3) ... [2019-12-28 00:35:59,479 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-12-28 00:35:59,489 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:35:59,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:35:59,498 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:35:59,498 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:35:59,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:35:59,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:35:59,706 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:35:59,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:35:59,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:35:59,706 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:35:59,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:35:59,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:35:59,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:35:59,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:35:59,727 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 00:36:01,759 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-28 00:36:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-28 00:36:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-28 00:36:01,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:01,772 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] [2019-12-28 00:36:01,772 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-28 00:36:01,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:01,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744502777] [2019-12-28 00:36:01,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:02,067 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-28 00:36:02,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744502777] [2019-12-28 00:36:02,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:02,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:36:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171189389] [2019-12-28 00:36:02,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:02,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:02,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-28 00:36:02,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:02,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:02,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:36:02,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:36:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:02,124 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-28 00:36:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:02,965 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-28 00:36:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:36:02,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-28 00:36:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:03,261 INFO L225 Difference]: With dead ends: 33592 [2019-12-28 00:36:03,261 INFO L226 Difference]: Without dead ends: 25704 [2019-12-28 00:36:03,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-28 00:36:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-28 00:36:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-28 00:36:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-28 00:36:05,792 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-28 00:36:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:05,793 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-28 00:36:05,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:36:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-28 00:36:05,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 00:36:05,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:05,811 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] [2019-12-28 00:36:05,812 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-28 00:36:05,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:05,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875174436] [2019-12-28 00:36:05,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:06,004 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-28 00:36:06,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875174436] [2019-12-28 00:36:06,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:06,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:06,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639831808] [2019-12-28 00:36:06,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:06,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:06,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 00:36:06,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:06,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:06,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:36:06,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:06,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:36:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:36:06,026 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-28 00:36:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:07,134 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-28 00:36:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:36:07,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 00:36:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:07,312 INFO L225 Difference]: With dead ends: 41082 [2019-12-28 00:36:07,312 INFO L226 Difference]: Without dead ends: 40546 [2019-12-28 00:36:07,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-28 00:36:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-28 00:36:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-28 00:36:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-28 00:36:09,999 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-28 00:36:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:10,001 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-28 00:36:10,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:36:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-28 00:36:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 00:36:10,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:10,013 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] [2019-12-28 00:36:10,014 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-28 00:36:10,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:10,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265322554] [2019-12-28 00:36:10,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:10,144 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-28 00:36:10,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265322554] [2019-12-28 00:36:10,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:10,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:10,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793838287] [2019-12-28 00:36:10,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:10,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:10,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 00:36:10,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:10,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:10,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:36:10,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:36:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:36:10,163 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-28 00:36:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:10,800 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-28 00:36:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:36:10,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 00:36:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:10,999 INFO L225 Difference]: With dead ends: 49779 [2019-12-28 00:36:11,000 INFO L226 Difference]: Without dead ends: 49275 [2019-12-28 00:36:11,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-28 00:36:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-28 00:36:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-28 00:36:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-28 00:36:14,137 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-28 00:36:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:14,138 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-28 00:36:14,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:36:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-28 00:36:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:36:14,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:14,145 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] [2019-12-28 00:36:14,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-28 00:36:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:14,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573527650] [2019-12-28 00:36:14,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:14,201 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-28 00:36:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573527650] [2019-12-28 00:36:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:14,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:36:14,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831194938] [2019-12-28 00:36:14,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:14,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:14,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 00:36:14,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:14,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:14,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:36:14,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:36:14,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:36:14,215 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-28 00:36:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:14,556 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-28 00:36:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:36:14,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-28 00:36:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:14,727 INFO L225 Difference]: With dead ends: 61088 [2019-12-28 00:36:14,728 INFO L226 Difference]: Without dead ends: 61088 [2019-12-28 00:36:14,728 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-28 00:36:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-28 00:36:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-28 00:36:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-28 00:36:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-28 00:36:16,298 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-28 00:36:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:16,299 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-28 00:36:16,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:36:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-28 00:36:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:36:16,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:16,317 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] [2019-12-28 00:36:16,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-28 00:36:16,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:16,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869599793] [2019-12-28 00:36:16,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:17,886 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-28 00:36:17,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869599793] [2019-12-28 00:36:17,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:17,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:36:17,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149603289] [2019-12-28 00:36:17,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:17,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:17,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:36:17,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:17,903 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:17,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:36:17,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:17,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:36:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:36:17,904 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-28 00:36:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:18,412 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-28 00:36:18,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:36:18,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 00:36:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:18,530 INFO L225 Difference]: With dead ends: 53337 [2019-12-28 00:36:18,530 INFO L226 Difference]: Without dead ends: 53337 [2019-12-28 00:36:18,530 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-28 00:36:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-28 00:36:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-28 00:36:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-28 00:36:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-28 00:36:19,686 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-28 00:36:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:19,686 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-28 00:36:19,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:36:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-28 00:36:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:36:19,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:19,700 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] [2019-12-28 00:36:19,701 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-28 00:36:19,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:19,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823512844] [2019-12-28 00:36:19,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:19,833 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-28 00:36:19,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823512844] [2019-12-28 00:36:19,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:19,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277447111] [2019-12-28 00:36:19,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:19,841 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:19,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:36:19,848 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:19,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:19,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:19,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:19,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:19,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:19,850 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-28 00:36:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:20,758 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-28 00:36:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:36:20,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 00:36:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:21,373 INFO L225 Difference]: With dead ends: 65267 [2019-12-28 00:36:21,374 INFO L226 Difference]: Without dead ends: 65267 [2019-12-28 00:36:21,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-28 00:36:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-28 00:36:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-28 00:36:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-28 00:36:25,201 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-28 00:36:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:25,201 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-28 00:36:25,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-28 00:36:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:36:25,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:25,214 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] [2019-12-28 00:36:25,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-28 00:36:25,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:25,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415618961] [2019-12-28 00:36:25,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:25,323 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-28 00:36:25,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415618961] [2019-12-28 00:36:25,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:25,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:36:25,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644806215] [2019-12-28 00:36:25,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:25,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:25,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:36:25,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:25,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:25,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:36:25,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:25,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:36:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:25,341 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-28 00:36:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:26,663 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-28 00:36:26,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:36:26,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 00:36:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:26,844 INFO L225 Difference]: With dead ends: 83686 [2019-12-28 00:36:26,844 INFO L226 Difference]: Without dead ends: 83686 [2019-12-28 00:36:26,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:36:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-28 00:36:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-28 00:36:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-28 00:36:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-28 00:36:28,610 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-28 00:36:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:28,610 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-28 00:36:28,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:36:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-28 00:36:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:36:28,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:28,623 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] [2019-12-28 00:36:28,623 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-28 00:36:28,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:28,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042494909] [2019-12-28 00:36:28,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:36:28,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042494909] [2019-12-28 00:36:28,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:28,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:36:28,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631393336] [2019-12-28 00:36:28,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:28,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:28,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:36:28,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:28,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:36:28,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:36:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:28,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:36:28,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:28,754 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 4 states. [2019-12-28 00:36:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:29,288 INFO L93 Difference]: Finished difference Result 12160 states and 37830 transitions. [2019-12-28 00:36:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:36:29,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 00:36:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:29,336 INFO L225 Difference]: With dead ends: 12160 [2019-12-28 00:36:29,336 INFO L226 Difference]: Without dead ends: 10675 [2019-12-28 00:36:29,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 00:36:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-12-28 00:36:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10626. [2019-12-28 00:36:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-28 00:36:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 32592 transitions. [2019-12-28 00:36:29,615 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 32592 transitions. Word has length 54 [2019-12-28 00:36:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:29,615 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 32592 transitions. [2019-12-28 00:36:29,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:36:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 32592 transitions. [2019-12-28 00:36:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:36:29,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:29,621 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] [2019-12-28 00:36:29,621 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:29,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-28 00:36:29,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:29,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052209752] [2019-12-28 00:36:29,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:29,744 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-28 00:36:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052209752] [2019-12-28 00:36:29,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:29,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:29,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [494494505] [2019-12-28 00:36:29,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:29,752 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:29,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 00:36:29,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:29,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:29,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:29,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:29,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:29,762 INFO L87 Difference]: Start difference. First operand 10626 states and 32592 transitions. Second operand 6 states. [2019-12-28 00:36:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:30,210 INFO L93 Difference]: Finished difference Result 13183 states and 39873 transitions. [2019-12-28 00:36:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:36:30,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 00:36:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:30,238 INFO L225 Difference]: With dead ends: 13183 [2019-12-28 00:36:30,238 INFO L226 Difference]: Without dead ends: 13120 [2019-12-28 00:36:30,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:36:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-28 00:36:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11049. [2019-12-28 00:36:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11049 states. [2019-12-28 00:36:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 33786 transitions. [2019-12-28 00:36:30,500 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 33786 transitions. Word has length 54 [2019-12-28 00:36:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:30,501 INFO L462 AbstractCegarLoop]: Abstraction has 11049 states and 33786 transitions. [2019-12-28 00:36:30,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 33786 transitions. [2019-12-28 00:36:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 00:36:30,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:30,508 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, 1, 1] [2019-12-28 00:36:30,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-28 00:36:30,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:30,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686049961] [2019-12-28 00:36:30,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:30,664 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-28 00:36:30,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686049961] [2019-12-28 00:36:30,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:30,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:30,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178473899] [2019-12-28 00:36:30,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:30,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:30,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 00:36:30,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:30,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:30,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:30,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:30,699 INFO L87 Difference]: Start difference. First operand 11049 states and 33786 transitions. Second operand 6 states. [2019-12-28 00:36:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:31,154 INFO L93 Difference]: Finished difference Result 13540 states and 40805 transitions. [2019-12-28 00:36:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:36:31,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 00:36:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:31,174 INFO L225 Difference]: With dead ends: 13540 [2019-12-28 00:36:31,174 INFO L226 Difference]: Without dead ends: 13479 [2019-12-28 00:36:31,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:36:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2019-12-28 00:36:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 12787. [2019-12-28 00:36:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2019-12-28 00:36:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 38735 transitions. [2019-12-28 00:36:31,432 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 38735 transitions. Word has length 62 [2019-12-28 00:36:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:31,432 INFO L462 AbstractCegarLoop]: Abstraction has 12787 states and 38735 transitions. [2019-12-28 00:36:31,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 38735 transitions. [2019-12-28 00:36:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:36:31,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:31,441 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:31,442 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -903159920, now seen corresponding path program 1 times [2019-12-28 00:36:31,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:31,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374670579] [2019-12-28 00:36:31,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:31,511 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-28 00:36:31,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374670579] [2019-12-28 00:36:31,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:31,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:36:31,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728472685] [2019-12-28 00:36:31,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:31,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:31,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 00:36:31,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:31,657 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:36:31,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:36:31,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:36:31,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:31,658 INFO L87 Difference]: Start difference. First operand 12787 states and 38735 transitions. Second operand 7 states. [2019-12-28 00:36:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:32,078 INFO L93 Difference]: Finished difference Result 15674 states and 46880 transitions. [2019-12-28 00:36:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:36:32,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 00:36:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:32,101 INFO L225 Difference]: With dead ends: 15674 [2019-12-28 00:36:32,101 INFO L226 Difference]: Without dead ends: 15674 [2019-12-28 00:36:32,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-12-28 00:36:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 14153. [2019-12-28 00:36:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2019-12-28 00:36:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42469 transitions. [2019-12-28 00:36:32,391 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42469 transitions. Word has length 66 [2019-12-28 00:36:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:32,391 INFO L462 AbstractCegarLoop]: Abstraction has 14153 states and 42469 transitions. [2019-12-28 00:36:32,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:36:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42469 transitions. [2019-12-28 00:36:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:36:32,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:32,398 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, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:32,398 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1314598033, now seen corresponding path program 1 times [2019-12-28 00:36:32,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:32,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433755219] [2019-12-28 00:36:32,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:32,447 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-28 00:36:32,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433755219] [2019-12-28 00:36:32,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:32,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:36:32,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1878780923] [2019-12-28 00:36:32,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:32,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:32,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 00:36:32,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:32,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:36:32,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:36:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:36:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:32,500 INFO L87 Difference]: Start difference. First operand 14153 states and 42469 transitions. Second operand 4 states. [2019-12-28 00:36:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:32,903 INFO L93 Difference]: Finished difference Result 14686 states and 43876 transitions. [2019-12-28 00:36:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:36:32,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 00:36:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:32,933 INFO L225 Difference]: With dead ends: 14686 [2019-12-28 00:36:32,933 INFO L226 Difference]: Without dead ends: 14686 [2019-12-28 00:36:32,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14686 states. [2019-12-28 00:36:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14686 to 14437. [2019-12-28 00:36:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14437 states. [2019-12-28 00:36:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14437 states to 14437 states and 43213 transitions. [2019-12-28 00:36:33,217 INFO L78 Accepts]: Start accepts. Automaton has 14437 states and 43213 transitions. Word has length 66 [2019-12-28 00:36:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:33,217 INFO L462 AbstractCegarLoop]: Abstraction has 14437 states and 43213 transitions. [2019-12-28 00:36:33,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:36:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 14437 states and 43213 transitions. [2019-12-28 00:36:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:33,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:33,229 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:33,229 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 789260736, now seen corresponding path program 1 times [2019-12-28 00:36:33,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:33,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020128892] [2019-12-28 00:36:33,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:33,319 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-28 00:36:33,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020128892] [2019-12-28 00:36:33,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:33,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:33,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348825057] [2019-12-28 00:36:33,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:33,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:33,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:33,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:33,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:36:33,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:36:33,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:33,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:36:33,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:33,432 INFO L87 Difference]: Start difference. First operand 14437 states and 43213 transitions. Second operand 8 states. [2019-12-28 00:36:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:34,275 INFO L93 Difference]: Finished difference Result 15429 states and 45576 transitions. [2019-12-28 00:36:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:36:34,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 00:36:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:34,298 INFO L225 Difference]: With dead ends: 15429 [2019-12-28 00:36:34,298 INFO L226 Difference]: Without dead ends: 15429 [2019-12-28 00:36:34,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:36:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-28 00:36:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 15010. [2019-12-28 00:36:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15010 states. [2019-12-28 00:36:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15010 states to 15010 states and 44510 transitions. [2019-12-28 00:36:34,499 INFO L78 Accepts]: Start accepts. Automaton has 15010 states and 44510 transitions. Word has length 68 [2019-12-28 00:36:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:34,500 INFO L462 AbstractCegarLoop]: Abstraction has 15010 states and 44510 transitions. [2019-12-28 00:36:34,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:36:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15010 states and 44510 transitions. [2019-12-28 00:36:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:34,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:34,509 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:34,509 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1287948607, now seen corresponding path program 1 times [2019-12-28 00:36:34,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:34,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373492621] [2019-12-28 00:36:34,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:34,613 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-28 00:36:34,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373492621] [2019-12-28 00:36:34,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:34,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:34,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104172583] [2019-12-28 00:36:34,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:34,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:34,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:34,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:34,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:36:34,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:36:34,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:36:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:34,722 INFO L87 Difference]: Start difference. First operand 15010 states and 44510 transitions. Second operand 8 states. [2019-12-28 00:36:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:35,367 INFO L93 Difference]: Finished difference Result 17281 states and 49779 transitions. [2019-12-28 00:36:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:36:35,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 00:36:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:35,391 INFO L225 Difference]: With dead ends: 17281 [2019-12-28 00:36:35,392 INFO L226 Difference]: Without dead ends: 17281 [2019-12-28 00:36:35,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:36:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2019-12-28 00:36:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 15702. [2019-12-28 00:36:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15702 states. [2019-12-28 00:36:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15702 states to 15702 states and 45760 transitions. [2019-12-28 00:36:35,748 INFO L78 Accepts]: Start accepts. Automaton has 15702 states and 45760 transitions. Word has length 68 [2019-12-28 00:36:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:35,748 INFO L462 AbstractCegarLoop]: Abstraction has 15702 states and 45760 transitions. [2019-12-28 00:36:35,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:36:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15702 states and 45760 transitions. [2019-12-28 00:36:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:35,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:35,758 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:35,758 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:35,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1076597694, now seen corresponding path program 1 times [2019-12-28 00:36:35,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:35,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567821489] [2019-12-28 00:36:35,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:35,827 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-28 00:36:35,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567821489] [2019-12-28 00:36:35,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:35,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:35,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285653188] [2019-12-28 00:36:35,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:35,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:35,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:35,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:35,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:36:35,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:35,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:35,885 INFO L87 Difference]: Start difference. First operand 15702 states and 45760 transitions. Second operand 6 states. [2019-12-28 00:36:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:36,368 INFO L93 Difference]: Finished difference Result 20231 states and 58824 transitions. [2019-12-28 00:36:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:36:36,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:36:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:36,397 INFO L225 Difference]: With dead ends: 20231 [2019-12-28 00:36:36,397 INFO L226 Difference]: Without dead ends: 20231 [2019-12-28 00:36:36,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-12-28 00:36:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 18521. [2019-12-28 00:36:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-28 00:36:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53710 transitions. [2019-12-28 00:36:36,647 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53710 transitions. Word has length 68 [2019-12-28 00:36:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:36,648 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53710 transitions. [2019-12-28 00:36:36,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53710 transitions. [2019-12-28 00:36:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:36,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:36,659 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:36,659 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:36,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1587131871, now seen corresponding path program 1 times [2019-12-28 00:36:36,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:36,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592995396] [2019-12-28 00:36:36,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:36,737 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-28 00:36:36,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592995396] [2019-12-28 00:36:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:36,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:36,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506678627] [2019-12-28 00:36:36,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:36,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:36,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:36,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:36,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:36:36,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:36:36,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:36:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:36,811 INFO L87 Difference]: Start difference. First operand 18521 states and 53710 transitions. Second operand 7 states. [2019-12-28 00:36:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:37,462 INFO L93 Difference]: Finished difference Result 25228 states and 72837 transitions. [2019-12-28 00:36:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:36:37,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-28 00:36:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:37,498 INFO L225 Difference]: With dead ends: 25228 [2019-12-28 00:36:37,498 INFO L226 Difference]: Without dead ends: 25228 [2019-12-28 00:36:37,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:36:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25228 states. [2019-12-28 00:36:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25228 to 20409. [2019-12-28 00:36:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-28 00:36:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 58984 transitions. [2019-12-28 00:36:37,789 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 58984 transitions. Word has length 68 [2019-12-28 00:36:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:37,790 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 58984 transitions. [2019-12-28 00:36:37,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:36:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 58984 transitions. [2019-12-28 00:36:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:37,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:37,798 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:37,799 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash 900380962, now seen corresponding path program 1 times [2019-12-28 00:36:37,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:37,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208868016] [2019-12-28 00:36:37,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:37,893 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-28 00:36:37,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208868016] [2019-12-28 00:36:37,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:37,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:37,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515945008] [2019-12-28 00:36:37,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:37,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:37,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:37,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:37,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:37,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:37,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:37,927 INFO L87 Difference]: Start difference. First operand 20409 states and 58984 transitions. Second operand 6 states. [2019-12-28 00:36:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:39,175 INFO L93 Difference]: Finished difference Result 26880 states and 78478 transitions. [2019-12-28 00:36:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:36:39,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:36:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:39,217 INFO L225 Difference]: With dead ends: 26880 [2019-12-28 00:36:39,217 INFO L226 Difference]: Without dead ends: 26769 [2019-12-28 00:36:39,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2019-12-28 00:36:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 24702. [2019-12-28 00:36:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24702 states. [2019-12-28 00:36:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24702 states to 24702 states and 71782 transitions. [2019-12-28 00:36:39,559 INFO L78 Accepts]: Start accepts. Automaton has 24702 states and 71782 transitions. Word has length 68 [2019-12-28 00:36:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:39,559 INFO L462 AbstractCegarLoop]: Abstraction has 24702 states and 71782 transitions. [2019-12-28 00:36:39,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24702 states and 71782 transitions. [2019-12-28 00:36:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:39,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:39,568 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:39,568 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:39,568 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-28 00:36:39,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:39,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156659615] [2019-12-28 00:36:39,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:39,694 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-28 00:36:39,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156659615] [2019-12-28 00:36:39,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:39,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:36:39,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065045334] [2019-12-28 00:36:39,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:39,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:39,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:39,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:39,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:36:39,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 00:36:39,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 00:36:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:36:39,859 INFO L87 Difference]: Start difference. First operand 24702 states and 71782 transitions. Second operand 12 states. [2019-12-28 00:36:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:41,367 INFO L93 Difference]: Finished difference Result 30982 states and 89506 transitions. [2019-12-28 00:36:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:36:41,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-28 00:36:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:41,412 INFO L225 Difference]: With dead ends: 30982 [2019-12-28 00:36:41,412 INFO L226 Difference]: Without dead ends: 30982 [2019-12-28 00:36:41,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:36:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-28 00:36:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 27343. [2019-12-28 00:36:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-28 00:36:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 79281 transitions. [2019-12-28 00:36:41,812 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 79281 transitions. Word has length 68 [2019-12-28 00:36:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:41,812 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 79281 transitions. [2019-12-28 00:36:41,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 00:36:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 79281 transitions. [2019-12-28 00:36:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:41,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:41,822 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:41,822 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-28 00:36:41,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:41,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433382234] [2019-12-28 00:36:41,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:41,902 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-28 00:36:41,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433382234] [2019-12-28 00:36:41,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:41,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:41,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700678804] [2019-12-28 00:36:41,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:41,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:41,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:36:41,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:41,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:36:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:41,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:41,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:41,969 INFO L87 Difference]: Start difference. First operand 27343 states and 79281 transitions. Second operand 6 states. [2019-12-28 00:36:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:42,040 INFO L93 Difference]: Finished difference Result 7438 states and 17579 transitions. [2019-12-28 00:36:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:36:42,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:36:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:42,050 INFO L225 Difference]: With dead ends: 7438 [2019-12-28 00:36:42,050 INFO L226 Difference]: Without dead ends: 6196 [2019-12-28 00:36:42,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2019-12-28 00:36:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5051. [2019-12-28 00:36:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-12-28 00:36:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 11647 transitions. [2019-12-28 00:36:42,136 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 11647 transitions. Word has length 68 [2019-12-28 00:36:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:42,136 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 11647 transitions. [2019-12-28 00:36:42,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 11647 transitions. [2019-12-28 00:36:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:36:42,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:42,142 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:42,142 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-28 00:36:42,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:42,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843175811] [2019-12-28 00:36:42,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:42,173 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-28 00:36:42,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843175811] [2019-12-28 00:36:42,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:42,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:36:42,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100680534] [2019-12-28 00:36:42,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:42,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:42,200 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 00:36:42,200 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:42,200 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:42,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:36:42,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:36:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:36:42,201 INFO L87 Difference]: Start difference. First operand 5051 states and 11647 transitions. Second operand 3 states. [2019-12-28 00:36:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:42,246 INFO L93 Difference]: Finished difference Result 6708 states and 15325 transitions. [2019-12-28 00:36:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:36:42,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-28 00:36:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:42,255 INFO L225 Difference]: With dead ends: 6708 [2019-12-28 00:36:42,255 INFO L226 Difference]: Without dead ends: 6708 [2019-12-28 00:36:42,256 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-28 00:36:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-28 00:36:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4999. [2019-12-28 00:36:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-28 00:36:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11249 transitions. [2019-12-28 00:36:42,353 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11249 transitions. Word has length 68 [2019-12-28 00:36:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:42,354 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11249 transitions. [2019-12-28 00:36:42,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:36:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11249 transitions. [2019-12-28 00:36:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:36:42,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:42,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:36:42,358 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-28 00:36:42,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:42,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508439123] [2019-12-28 00:36:42,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:42,434 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-28 00:36:42,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508439123] [2019-12-28 00:36:42,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:42,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:36:42,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [892049307] [2019-12-28 00:36:42,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:42,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:42,469 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 74 transitions. [2019-12-28 00:36:42,469 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:42,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:42,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:36:42,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:36:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:42,471 INFO L87 Difference]: Start difference. First operand 4999 states and 11249 transitions. Second operand 7 states. [2019-12-28 00:36:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:42,993 INFO L93 Difference]: Finished difference Result 5810 states and 12970 transitions. [2019-12-28 00:36:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:36:42,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-28 00:36:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:43,004 INFO L225 Difference]: With dead ends: 5810 [2019-12-28 00:36:43,004 INFO L226 Difference]: Without dead ends: 5757 [2019-12-28 00:36:43,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 00:36:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-28 00:36:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5015. [2019-12-28 00:36:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5015 states. [2019-12-28 00:36:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 11212 transitions. [2019-12-28 00:36:43,115 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 11212 transitions. Word has length 74 [2019-12-28 00:36:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:43,115 INFO L462 AbstractCegarLoop]: Abstraction has 5015 states and 11212 transitions. [2019-12-28 00:36:43,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:36:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 11212 transitions. [2019-12-28 00:36:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 00:36:43,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:43,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:43,125 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:43,126 INFO L82 PathProgramCache]: Analyzing trace with hash 316232134, now seen corresponding path program 1 times [2019-12-28 00:36:43,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:43,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232456526] [2019-12-28 00:36:43,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:43,183 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-28 00:36:43,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232456526] [2019-12-28 00:36:43,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:43,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:36:43,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844335672] [2019-12-28 00:36:43,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:43,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:43,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 273 transitions. [2019-12-28 00:36:43,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:43,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:36:43,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:36:43,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:43,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:36:43,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:36:43,354 INFO L87 Difference]: Start difference. First operand 5015 states and 11212 transitions. Second operand 3 states. [2019-12-28 00:36:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:43,608 INFO L93 Difference]: Finished difference Result 6355 states and 13991 transitions. [2019-12-28 00:36:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:36:43,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-28 00:36:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:43,620 INFO L225 Difference]: With dead ends: 6355 [2019-12-28 00:36:43,620 INFO L226 Difference]: Without dead ends: 6355 [2019-12-28 00:36:43,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 00:36:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-28 00:36:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5918. [2019-12-28 00:36:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-12-28 00:36:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13072 transitions. [2019-12-28 00:36:43,744 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13072 transitions. Word has length 93 [2019-12-28 00:36:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:43,744 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13072 transitions. [2019-12-28 00:36:43,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:36:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13072 transitions. [2019-12-28 00:36:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 00:36:43,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:43,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:43,755 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1415085423, now seen corresponding path program 1 times [2019-12-28 00:36:43,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:43,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562135495] [2019-12-28 00:36:43,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:43,841 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-28 00:36:43,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562135495] [2019-12-28 00:36:43,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:43,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:36:43,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789553552] [2019-12-28 00:36:43,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:43,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:43,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 196 transitions. [2019-12-28 00:36:43,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:43,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:43,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:36:43,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:36:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:36:43,970 INFO L87 Difference]: Start difference. First operand 5918 states and 13072 transitions. Second operand 4 states. [2019-12-28 00:36:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:44,087 INFO L93 Difference]: Finished difference Result 6314 states and 13994 transitions. [2019-12-28 00:36:44,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:36:44,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-28 00:36:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:44,096 INFO L225 Difference]: With dead ends: 6314 [2019-12-28 00:36:44,096 INFO L226 Difference]: Without dead ends: 6314 [2019-12-28 00:36:44,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:36:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-28 00:36:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5757. [2019-12-28 00:36:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-28 00:36:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 12813 transitions. [2019-12-28 00:36:44,185 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 12813 transitions. Word has length 93 [2019-12-28 00:36:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:44,185 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 12813 transitions. [2019-12-28 00:36:44,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:36:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 12813 transitions. [2019-12-28 00:36:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:44,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:44,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:44,193 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1096662197, now seen corresponding path program 1 times [2019-12-28 00:36:44,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:44,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337004549] [2019-12-28 00:36:44,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:44,253 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-28 00:36:44,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337004549] [2019-12-28 00:36:44,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:44,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:44,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406573568] [2019-12-28 00:36:44,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:44,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:44,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 279 transitions. [2019-12-28 00:36:44,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:44,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:36:44,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:36:44,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:36:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:36:44,395 INFO L87 Difference]: Start difference. First operand 5757 states and 12813 transitions. Second operand 5 states. [2019-12-28 00:36:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:45,249 INFO L93 Difference]: Finished difference Result 12046 states and 26381 transitions. [2019-12-28 00:36:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:36:45,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 00:36:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:45,263 INFO L225 Difference]: With dead ends: 12046 [2019-12-28 00:36:45,263 INFO L226 Difference]: Without dead ends: 12032 [2019-12-28 00:36:45,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:36:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-12-28 00:36:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7935. [2019-12-28 00:36:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-12-28 00:36:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 17552 transitions. [2019-12-28 00:36:45,364 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 17552 transitions. Word has length 95 [2019-12-28 00:36:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:45,365 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 17552 transitions. [2019-12-28 00:36:45,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:36:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 17552 transitions. [2019-12-28 00:36:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:45,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:45,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:45,375 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash 148102284, now seen corresponding path program 1 times [2019-12-28 00:36:45,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:45,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913841928] [2019-12-28 00:36:45,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:45,455 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-28 00:36:45,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913841928] [2019-12-28 00:36:45,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:45,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:45,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633698717] [2019-12-28 00:36:45,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:45,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:45,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 279 transitions. [2019-12-28 00:36:45,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:45,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 00:36:45,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:36:45,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:45,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:36:45,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:36:45,842 INFO L87 Difference]: Start difference. First operand 7935 states and 17552 transitions. Second operand 11 states. [2019-12-28 00:36:46,296 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-28 00:36:49,170 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-28 00:36:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:49,897 INFO L93 Difference]: Finished difference Result 16786 states and 36940 transitions. [2019-12-28 00:36:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 00:36:49,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-28 00:36:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:49,917 INFO L225 Difference]: With dead ends: 16786 [2019-12-28 00:36:49,917 INFO L226 Difference]: Without dead ends: 16786 [2019-12-28 00:36:49,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 00:36:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16786 states. [2019-12-28 00:36:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16786 to 7937. [2019-12-28 00:36:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-28 00:36:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17521 transitions. [2019-12-28 00:36:50,043 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17521 transitions. Word has length 95 [2019-12-28 00:36:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:50,043 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17521 transitions. [2019-12-28 00:36:50,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:36:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17521 transitions. [2019-12-28 00:36:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:50,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:50,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:50,054 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2039041963, now seen corresponding path program 1 times [2019-12-28 00:36:50,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:50,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372718457] [2019-12-28 00:36:50,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:50,196 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-28 00:36:50,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372718457] [2019-12-28 00:36:50,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:50,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:36:50,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568864541] [2019-12-28 00:36:50,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:50,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:50,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:36:50,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:50,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:36:50,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:36:50,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:36:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:36:50,381 INFO L87 Difference]: Start difference. First operand 7937 states and 17521 transitions. Second operand 11 states. [2019-12-28 00:36:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:53,253 INFO L93 Difference]: Finished difference Result 13822 states and 30343 transitions. [2019-12-28 00:36:53,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 00:36:53,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-28 00:36:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:53,268 INFO L225 Difference]: With dead ends: 13822 [2019-12-28 00:36:53,268 INFO L226 Difference]: Without dead ends: 13777 [2019-12-28 00:36:53,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-12-28 00:36:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2019-12-28 00:36:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 9183. [2019-12-28 00:36:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9183 states. [2019-12-28 00:36:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9183 states to 9183 states and 20300 transitions. [2019-12-28 00:36:53,385 INFO L78 Accepts]: Start accepts. Automaton has 9183 states and 20300 transitions. Word has length 95 [2019-12-28 00:36:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 9183 states and 20300 transitions. [2019-12-28 00:36:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:36:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9183 states and 20300 transitions. [2019-12-28 00:36:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:53,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:53,394 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:53,394 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:53,394 INFO L82 PathProgramCache]: Analyzing trace with hash 458973974, now seen corresponding path program 1 times [2019-12-28 00:36:53,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:53,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62742982] [2019-12-28 00:36:53,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:53,592 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-28 00:36:53,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62742982] [2019-12-28 00:36:53,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:53,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:36:53,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646249900] [2019-12-28 00:36:53,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:53,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:53,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:36:53,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:53,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:36:53,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:36:53,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:36:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:53,710 INFO L87 Difference]: Start difference. First operand 9183 states and 20300 transitions. Second operand 8 states. [2019-12-28 00:36:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:54,597 INFO L93 Difference]: Finished difference Result 14977 states and 33367 transitions. [2019-12-28 00:36:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:36:54,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 00:36:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:54,623 INFO L225 Difference]: With dead ends: 14977 [2019-12-28 00:36:54,623 INFO L226 Difference]: Without dead ends: 14977 [2019-12-28 00:36:54,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:36:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14977 states. [2019-12-28 00:36:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14977 to 9566. [2019-12-28 00:36:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2019-12-28 00:36:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 21253 transitions. [2019-12-28 00:36:54,883 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 21253 transitions. Word has length 95 [2019-12-28 00:36:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:54,883 INFO L462 AbstractCegarLoop]: Abstraction has 9566 states and 21253 transitions. [2019-12-28 00:36:54,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:36:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 21253 transitions. [2019-12-28 00:36:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:54,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:54,896 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:54,896 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1346477655, now seen corresponding path program 1 times [2019-12-28 00:36:54,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:54,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682977491] [2019-12-28 00:36:54,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:55,067 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-28 00:36:55,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682977491] [2019-12-28 00:36:55,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:55,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:36:55,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638364607] [2019-12-28 00:36:55,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:55,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:55,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:36:55,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:55,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:36:55,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:36:55,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:36:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:36:55,181 INFO L87 Difference]: Start difference. First operand 9566 states and 21253 transitions. Second operand 7 states. [2019-12-28 00:36:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:55,383 INFO L93 Difference]: Finished difference Result 9640 states and 21553 transitions. [2019-12-28 00:36:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:36:55,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 00:36:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:55,395 INFO L225 Difference]: With dead ends: 9640 [2019-12-28 00:36:55,396 INFO L226 Difference]: Without dead ends: 9640 [2019-12-28 00:36:55,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:36:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2019-12-28 00:36:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 7361. [2019-12-28 00:36:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7361 states. [2019-12-28 00:36:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7361 states to 7361 states and 16388 transitions. [2019-12-28 00:36:55,517 INFO L78 Accepts]: Start accepts. Automaton has 7361 states and 16388 transitions. Word has length 95 [2019-12-28 00:36:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:55,518 INFO L462 AbstractCegarLoop]: Abstraction has 7361 states and 16388 transitions. [2019-12-28 00:36:55,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:36:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7361 states and 16388 transitions. [2019-12-28 00:36:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:36:55,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:55,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:55,527 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:55,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash -385497897, now seen corresponding path program 1 times [2019-12-28 00:36:55,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:55,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594986122] [2019-12-28 00:36:55,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:55,648 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-28 00:36:55,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594986122] [2019-12-28 00:36:55,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:55,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:36:55,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60807252] [2019-12-28 00:36:55,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:55,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:55,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:36:55,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:55,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:55,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:36:55,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:36:55,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:55,763 INFO L87 Difference]: Start difference. First operand 7361 states and 16388 transitions. Second operand 6 states. [2019-12-28 00:36:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:55,904 INFO L93 Difference]: Finished difference Result 7091 states and 15614 transitions. [2019-12-28 00:36:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:36:55,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 00:36:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:55,913 INFO L225 Difference]: With dead ends: 7091 [2019-12-28 00:36:55,913 INFO L226 Difference]: Without dead ends: 7091 [2019-12-28 00:36:55,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:36:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7091 states. [2019-12-28 00:36:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7091 to 4428. [2019-12-28 00:36:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2019-12-28 00:36:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 9770 transitions. [2019-12-28 00:36:55,998 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 9770 transitions. Word has length 95 [2019-12-28 00:36:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:55,999 INFO L462 AbstractCegarLoop]: Abstraction has 4428 states and 9770 transitions. [2019-12-28 00:36:55,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:36:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 9770 transitions. [2019-12-28 00:36:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:36:56,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:56,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:56,004 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-28 00:36:56,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:56,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025137475] [2019-12-28 00:36:56,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:56,109 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-28 00:36:56,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025137475] [2019-12-28 00:36:56,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:56,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:36:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749430479] [2019-12-28 00:36:56,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:56,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:56,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 00:36:56,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:56,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:36:56,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:36:56,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:36:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:36:56,394 INFO L87 Difference]: Start difference. First operand 4428 states and 9770 transitions. Second operand 5 states. [2019-12-28 00:36:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:36:56,453 INFO L93 Difference]: Finished difference Result 4428 states and 9761 transitions. [2019-12-28 00:36:56,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:36:56,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-28 00:36:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:36:56,461 INFO L225 Difference]: With dead ends: 4428 [2019-12-28 00:36:56,462 INFO L226 Difference]: Without dead ends: 4428 [2019-12-28 00:36:56,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:36:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2019-12-28 00:36:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4428. [2019-12-28 00:36:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2019-12-28 00:36:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 9761 transitions. [2019-12-28 00:36:56,544 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 9761 transitions. Word has length 97 [2019-12-28 00:36:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:36:56,545 INFO L462 AbstractCegarLoop]: Abstraction has 4428 states and 9761 transitions. [2019-12-28 00:36:56,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:36:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 9761 transitions. [2019-12-28 00:36:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:36:56,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:36:56,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:36:56,553 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:36:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:36:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-28 00:36:56,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:36:56,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941134597] [2019-12-28 00:36:56,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:36:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:36:56,740 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-28 00:36:56,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941134597] [2019-12-28 00:36:56,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:36:56,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 00:36:56,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1945285877] [2019-12-28 00:36:56,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:36:56,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:36:56,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 00:36:56,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:36:57,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 00:36:57,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 00:36:57,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:36:57,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 00:36:57,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:36:57,047 INFO L87 Difference]: Start difference. First operand 4428 states and 9761 transitions. Second operand 15 states. [2019-12-28 00:37:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:01,742 INFO L93 Difference]: Finished difference Result 18034 states and 40205 transitions. [2019-12-28 00:37:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-28 00:37:01,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-28 00:37:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:01,756 INFO L225 Difference]: With dead ends: 18034 [2019-12-28 00:37:01,757 INFO L226 Difference]: Without dead ends: 12220 [2019-12-28 00:37:01,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2019-12-28 00:37:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2019-12-28 00:37:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 4522. [2019-12-28 00:37:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4522 states. [2019-12-28 00:37:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 9896 transitions. [2019-12-28 00:37:01,840 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 9896 transitions. Word has length 97 [2019-12-28 00:37:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:01,840 INFO L462 AbstractCegarLoop]: Abstraction has 4522 states and 9896 transitions. [2019-12-28 00:37:01,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 00:37:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 9896 transitions. [2019-12-28 00:37:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:37:01,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:01,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 00:37:01,844 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-28 00:37:01,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:01,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644233935] [2019-12-28 00:37:01,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:37:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:37:01,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:37:01,973 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:37:02,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:37:02 BasicIcfg [2019-12-28 00:37:02,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:37:02,226 INFO L168 Benchmark]: Toolchain (without parser) took 64363.43 ms. Allocated memory was 136.8 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 98.4 MB in the beginning and 782.7 MB in the end (delta: -684.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,227 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.42 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.1 MB in the beginning and 154.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,232 INFO L168 Benchmark]: Boogie Preprocessor took 38.21 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,233 INFO L168 Benchmark]: RCFGBuilder took 757.26 ms. Allocated memory is still 200.3 MB. Free memory was 149.2 MB in the beginning and 105.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,233 INFO L168 Benchmark]: TraceAbstraction took 62753.45 ms. Allocated memory was 200.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 104.4 MB in the beginning and 782.7 MB in the end (delta: -678.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-28 00:37:02,236 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.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.42 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.1 MB in the beginning and 154.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 200.3 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.21 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 149.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 757.26 ms. Allocated memory is still 200.3 MB. Free memory was 149.2 MB in the beginning and 105.0 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62753.45 ms. Allocated memory was 200.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 104.4 MB in the beginning and 782.7 MB in the end (delta: -678.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.2s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9441 SDtfs, 11428 SDslu, 27884 SDs, 0 SdLazy, 16344 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 177 SyntacticMatches, 20 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 100936 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 439879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...