/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/mix031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:54:13,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:54:13,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:54:13,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:54:13,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:54:13,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:54:13,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:54:13,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:54:13,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:54:13,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:54:13,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:54:13,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:54:13,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:54:13,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:54:13,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:54:13,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:54:13,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:54:13,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:54:13,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:54:13,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:54:13,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:54:13,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:54:13,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:54:13,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:54:13,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:54:13,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:54:13,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:54:13,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:54:13,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:54:13,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:54:13,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:54:13,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:54:13,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:54:13,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:54:13,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:54:13,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:54:13,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:54:13,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:54:13,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:54:13,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:54:13,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:54:13,711 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 01:54:13,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:54:13,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:54:13,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:54:13,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:54:13,727 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:54:13,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:54:13,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:54:13,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:54:13,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:54:13,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:54:13,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:54:13,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:54:13,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:54:13,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:54:13,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:54:13,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:54:13,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:54:13,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:54:13,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:54:13,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:54:13,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:54:13,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:54:14,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:54:14,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:54:14,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:54:14,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:54:14,026 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:54:14,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-28 01:54:14,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087f67f19/cbba2c0608e742aba3bd75158b9ff588/FLAGe22997a01 [2019-12-28 01:54:14,634 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:54:14,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-28 01:54:14,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087f67f19/cbba2c0608e742aba3bd75158b9ff588/FLAGe22997a01 [2019-12-28 01:54:14,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/087f67f19/cbba2c0608e742aba3bd75158b9ff588 [2019-12-28 01:54:14,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:54:14,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:54:14,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:54:14,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:54:14,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:54:14,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:54:14" (1/1) ... [2019-12-28 01:54:14,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:14, skipping insertion in model container [2019-12-28 01:54:14,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:54:14" (1/1) ... [2019-12-28 01:54:14,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:54:15,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:54:15,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:54:15,604 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:54:15,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:54:15,777 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:54:15,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15 WrapperNode [2019-12-28 01:54:15,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:54:15,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:54:15,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:54:15,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:54:15,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:54:15,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:54:15,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:54:15,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:54:15,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (1/1) ... [2019-12-28 01:54:15,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:54:15,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:54:15,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:54:15,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:54:15,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (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 01:54:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:54:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:54:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:54:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:54:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:54:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:54:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:54:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:54:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:54:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:54:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:54:15,977 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 01:54:16,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:54:16,646 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:54:16,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:54:16 BoogieIcfgContainer [2019-12-28 01:54:16,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:54:16,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:54:16,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:54:16,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:54:16,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:54:14" (1/3) ... [2019-12-28 01:54:16,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af84bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:54:16, skipping insertion in model container [2019-12-28 01:54:16,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:54:15" (2/3) ... [2019-12-28 01:54:16,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af84bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:54:16, skipping insertion in model container [2019-12-28 01:54:16,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:54:16" (3/3) ... [2019-12-28 01:54:16,657 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-28 01:54:16,668 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:54:16,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:54:16,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:54:16,678 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:54:16,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,718 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,718 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:54:16,807 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:54:16,828 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:54:16,828 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:54:16,828 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:54:16,828 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:54:16,829 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:54:16,829 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:54:16,829 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:54:16,829 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:54:16,843 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 167 transitions [2019-12-28 01:54:18,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-12-28 01:54:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-12-28 01:54:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-28 01:54:18,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:18,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] [2019-12-28 01:54:18,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:18,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1982457826, now seen corresponding path program 1 times [2019-12-28 01:54:18,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:18,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000503812] [2019-12-28 01:54:18,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:18,702 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 01:54:18,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000503812] [2019-12-28 01:54:18,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:18,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:18,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [433637833] [2019-12-28 01:54:18,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:18,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:18,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-28 01:54:18,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:18,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:18,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:54:18,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:54:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:54:18,761 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-12-28 01:54:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:20,106 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-12-28 01:54:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:54:20,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-28 01:54:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:20,314 INFO L225 Difference]: With dead ends: 26619 [2019-12-28 01:54:20,314 INFO L226 Difference]: Without dead ends: 20363 [2019-12-28 01:54:20,318 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 01:54:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-12-28 01:54:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-12-28 01:54:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-12-28 01:54:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-12-28 01:54:21,384 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-12-28 01:54:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:21,385 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-12-28 01:54:21,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:54:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-12-28 01:54:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:54:21,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:21,399 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 01:54:21,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1965107530, now seen corresponding path program 1 times [2019-12-28 01:54:21,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:21,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412305621] [2019-12-28 01:54:21,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:21,621 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 01:54:21,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412305621] [2019-12-28 01:54:21,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:21,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:21,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662384134] [2019-12-28 01:54:21,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:21,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:21,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:54:21,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:21,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:21,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:21,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:21,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:21,640 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-12-28 01:54:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:22,569 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-12-28 01:54:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:54:22,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 01:54:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:22,713 INFO L225 Difference]: With dead ends: 31841 [2019-12-28 01:54:22,713 INFO L226 Difference]: Without dead ends: 31289 [2019-12-28 01:54:22,714 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 01:54:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-12-28 01:54:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-12-28 01:54:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-12-28 01:54:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-12-28 01:54:24,906 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-12-28 01:54:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:24,907 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-12-28 01:54:24,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-12-28 01:54:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 01:54:24,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:24,914 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] [2019-12-28 01:54:24,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:24,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2091945449, now seen corresponding path program 1 times [2019-12-28 01:54:24,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:24,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125621745] [2019-12-28 01:54:24,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:25,014 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 01:54:25,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125621745] [2019-12-28 01:54:25,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:25,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:25,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1851733268] [2019-12-28 01:54:25,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:25,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:25,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-28 01:54:25,033 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:25,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:54:25,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:54:25,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:54:25,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:54:25,120 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 6 states. [2019-12-28 01:54:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:25,740 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-12-28 01:54:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:54:25,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-28 01:54:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:25,893 INFO L225 Difference]: With dead ends: 38699 [2019-12-28 01:54:25,893 INFO L226 Difference]: Without dead ends: 38251 [2019-12-28 01:54:25,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-12-28 01:54:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-12-28 01:54:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-12-28 01:54:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-12-28 01:54:28,999 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-12-28 01:54:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:29,000 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-12-28 01:54:29,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:54:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-12-28 01:54:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:54:29,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:29,021 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] [2019-12-28 01:54:29,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 568644221, now seen corresponding path program 1 times [2019-12-28 01:54:29,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:29,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088436731] [2019-12-28 01:54:29,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:29,102 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 01:54:29,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088436731] [2019-12-28 01:54:29,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:29,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:54:29,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115480856] [2019-12-28 01:54:29,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:29,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:29,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 141 transitions. [2019-12-28 01:54:29,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:29,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:54:29,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:29,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:29,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:29,183 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 5 states. [2019-12-28 01:54:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:29,532 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-12-28 01:54:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:54:29,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 01:54:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:29,716 INFO L225 Difference]: With dead ends: 42415 [2019-12-28 01:54:29,716 INFO L226 Difference]: Without dead ends: 42415 [2019-12-28 01:54:29,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-12-28 01:54:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-12-28 01:54:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-12-28 01:54:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-12-28 01:54:30,967 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-12-28 01:54:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:30,967 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-12-28 01:54:30,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-12-28 01:54:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:54:30,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:30,985 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] [2019-12-28 01:54:30,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:30,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:30,986 INFO L82 PathProgramCache]: Analyzing trace with hash -208895999, now seen corresponding path program 1 times [2019-12-28 01:54:30,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:30,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646087602] [2019-12-28 01:54:30,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:31,125 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 01:54:31,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646087602] [2019-12-28 01:54:31,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:31,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:31,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1854337059] [2019-12-28 01:54:31,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:31,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:31,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:54:31,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:31,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:54:31,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:54:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:54:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:54:31,173 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 8 states. [2019-12-28 01:54:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:32,421 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-12-28 01:54:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:54:32,423 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:54:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:32,565 INFO L225 Difference]: With dead ends: 51814 [2019-12-28 01:54:32,565 INFO L226 Difference]: Without dead ends: 51014 [2019-12-28 01:54:32,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:54:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-12-28 01:54:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-12-28 01:54:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-12-28 01:54:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-12-28 01:54:35,184 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-12-28 01:54:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:35,184 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-12-28 01:54:35,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:54:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-12-28 01:54:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:54:35,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:35,204 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] [2019-12-28 01:54:35,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2005847358, now seen corresponding path program 1 times [2019-12-28 01:54:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:35,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743558144] [2019-12-28 01:54:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:35,307 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 01:54:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743558144] [2019-12-28 01:54:35,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:35,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:54:35,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [608133589] [2019-12-28 01:54:35,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:35,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:35,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:54:35,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:35,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:54:35,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:54:35,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:54:35,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:35,345 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 9 states. [2019-12-28 01:54:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:36,673 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-12-28 01:54:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:54:36,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-28 01:54:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:37,262 INFO L225 Difference]: With dead ends: 68550 [2019-12-28 01:54:37,263 INFO L226 Difference]: Without dead ends: 68550 [2019-12-28 01:54:37,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:54:37,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-12-28 01:54:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-12-28 01:54:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-12-28 01:54:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-12-28 01:54:40,794 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-12-28 01:54:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:40,794 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-12-28 01:54:40,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:54:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-12-28 01:54:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:54:40,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:40,809 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] [2019-12-28 01:54:40,809 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1118343677, now seen corresponding path program 1 times [2019-12-28 01:54:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:40,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220763080] [2019-12-28 01:54:40,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:40,914 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 01:54:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220763080] [2019-12-28 01:54:40,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:40,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:40,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958282010] [2019-12-28 01:54:40,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:40,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:40,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:54:40,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:40,929 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:40,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:54:40,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:54:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:54:40,931 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-12-28 01:54:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:40,990 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-12-28 01:54:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:54:40,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 01:54:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:41,004 INFO L225 Difference]: With dead ends: 10469 [2019-12-28 01:54:41,005 INFO L226 Difference]: Without dead ends: 9223 [2019-12-28 01:54:41,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 01:54:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-12-28 01:54:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-12-28 01:54:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-12-28 01:54:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-12-28 01:54:41,123 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-12-28 01:54:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:41,123 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-12-28 01:54:41,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:54:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-12-28 01:54:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:54:41,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:41,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] [2019-12-28 01:54:41,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:41,125 INFO L82 PathProgramCache]: Analyzing trace with hash -195256504, now seen corresponding path program 1 times [2019-12-28 01:54:41,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:41,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557983430] [2019-12-28 01:54:41,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:54:41,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557983430] [2019-12-28 01:54:41,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:41,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:41,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985746533] [2019-12-28 01:54:41,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:41,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:41,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 177 transitions. [2019-12-28 01:54:41,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:41,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:54:41,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:54:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:54:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:54:41,303 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 8 states. [2019-12-28 01:54:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:41,856 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-12-28 01:54:41,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:54:41,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:54:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:41,873 INFO L225 Difference]: With dead ends: 11222 [2019-12-28 01:54:41,873 INFO L226 Difference]: Without dead ends: 11135 [2019-12-28 01:54:41,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:54:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-12-28 01:54:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-12-28 01:54:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-12-28 01:54:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-12-28 01:54:42,035 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-12-28 01:54:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:42,035 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-12-28 01:54:42,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:54:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-12-28 01:54:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:54:42,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:42,041 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] [2019-12-28 01:54:42,041 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash 141668315, now seen corresponding path program 1 times [2019-12-28 01:54:42,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:42,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839128912] [2019-12-28 01:54:42,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:42,100 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 01:54:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839128912] [2019-12-28 01:54:42,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:42,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392910308] [2019-12-28 01:54:42,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:42,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:42,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:54:42,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:42,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:54:42,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:42,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:42,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:42,156 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 5 states. [2019-12-28 01:54:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:42,387 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-12-28 01:54:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:54:42,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 01:54:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:42,414 INFO L225 Difference]: With dead ends: 10891 [2019-12-28 01:54:42,415 INFO L226 Difference]: Without dead ends: 10891 [2019-12-28 01:54:42,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:54:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-12-28 01:54:42,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-12-28 01:54:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-12-28 01:54:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-12-28 01:54:42,641 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-12-28 01:54:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:42,641 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-12-28 01:54:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-12-28 01:54:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:54:42,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:42,651 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] [2019-12-28 01:54:42,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1884478650, now seen corresponding path program 1 times [2019-12-28 01:54:42,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:42,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734479410] [2019-12-28 01:54:42,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:42,983 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 01:54:42,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734479410] [2019-12-28 01:54:42,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:42,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:42,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441169778] [2019-12-28 01:54:42,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:42,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:43,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:54:43,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:43,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:54:43,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:54:43,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:43,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:54:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:54:43,041 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 7 states. [2019-12-28 01:54:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:43,621 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-12-28 01:54:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 01:54:43,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 01:54:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:43,645 INFO L225 Difference]: With dead ends: 12789 [2019-12-28 01:54:43,645 INFO L226 Difference]: Without dead ends: 12741 [2019-12-28 01:54:43,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:54:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-12-28 01:54:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-12-28 01:54:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-12-28 01:54:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-12-28 01:54:43,795 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-12-28 01:54:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:43,796 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-12-28 01:54:43,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:54:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-12-28 01:54:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:54:43,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:43,803 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] [2019-12-28 01:54:43,803 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash -17868351, now seen corresponding path program 1 times [2019-12-28 01:54:43,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:43,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277178950] [2019-12-28 01:54:43,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:43,867 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 01:54:43,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277178950] [2019-12-28 01:54:43,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:43,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:43,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [917493255] [2019-12-28 01:54:43,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:43,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:43,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:54:43,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:43,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:43,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:54:43,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:54:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:54:43,894 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-12-28 01:54:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:44,155 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-12-28 01:54:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:54:44,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 01:54:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:44,174 INFO L225 Difference]: With dead ends: 13324 [2019-12-28 01:54:44,175 INFO L226 Difference]: Without dead ends: 13324 [2019-12-28 01:54:44,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 01:54:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-12-28 01:54:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-12-28 01:54:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-12-28 01:54:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-12-28 01:54:44,336 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-12-28 01:54:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:44,336 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-12-28 01:54:44,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:54:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-12-28 01:54:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:54:44,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:44,345 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] [2019-12-28 01:54:44,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:44,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2095077694, now seen corresponding path program 1 times [2019-12-28 01:54:44,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:44,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981654280] [2019-12-28 01:54:44,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:44,380 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 01:54:44,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981654280] [2019-12-28 01:54:44,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:44,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:54:44,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787780692] [2019-12-28 01:54:44,382 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:44,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:44,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:54:44,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:44,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:44,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:54:44,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:54:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:54:44,407 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-12-28 01:54:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:44,591 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-12-28 01:54:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:54:44,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 01:54:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:44,610 INFO L225 Difference]: With dead ends: 12704 [2019-12-28 01:54:44,610 INFO L226 Difference]: Without dead ends: 12704 [2019-12-28 01:54:44,610 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 01:54:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-12-28 01:54:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-12-28 01:54:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-12-28 01:54:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-12-28 01:54:44,773 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-12-28 01:54:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:44,773 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-12-28 01:54:44,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:54:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-12-28 01:54:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:44,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:44,784 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] [2019-12-28 01:54:44,784 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1715982354, now seen corresponding path program 1 times [2019-12-28 01:54:44,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:44,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717090096] [2019-12-28 01:54:44,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:45,051 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 01:54:45,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717090096] [2019-12-28 01:54:45,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:45,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:45,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113804096] [2019-12-28 01:54:45,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:45,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:45,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:45,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:45,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:45,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:54:45,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:45,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:54:45,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:54:45,084 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-12-28 01:54:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:45,636 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-12-28 01:54:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:54:45,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:54:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:45,667 INFO L225 Difference]: With dead ends: 13737 [2019-12-28 01:54:45,668 INFO L226 Difference]: Without dead ends: 13737 [2019-12-28 01:54:45,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:54:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-12-28 01:54:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-12-28 01:54:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-12-28 01:54:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-12-28 01:54:45,927 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-12-28 01:54:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:45,927 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-12-28 01:54:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:54:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-12-28 01:54:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:45,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:45,946 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] [2019-12-28 01:54:45,947 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash 501775599, now seen corresponding path program 1 times [2019-12-28 01:54:45,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:45,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937418151] [2019-12-28 01:54:45,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:46,091 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 01:54:46,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937418151] [2019-12-28 01:54:46,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:46,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:46,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963751895] [2019-12-28 01:54:46,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:46,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:46,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:46,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:46,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:46,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:54:46,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:46,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:54:46,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:54:46,119 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-12-28 01:54:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:46,593 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-12-28 01:54:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:54:46,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:54:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:46,615 INFO L225 Difference]: With dead ends: 15574 [2019-12-28 01:54:46,615 INFO L226 Difference]: Without dead ends: 15574 [2019-12-28 01:54:46,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-12-28 01:54:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-12-28 01:54:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-12-28 01:54:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-12-28 01:54:46,801 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-12-28 01:54:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:46,801 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-12-28 01:54:46,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:54:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-12-28 01:54:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:46,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:46,815 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] [2019-12-28 01:54:46,815 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:46,815 INFO L82 PathProgramCache]: Analyzing trace with hash 713126512, now seen corresponding path program 1 times [2019-12-28 01:54:46,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:46,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256138022] [2019-12-28 01:54:46,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:46,880 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 01:54:46,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256138022] [2019-12-28 01:54:46,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:46,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:46,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47713938] [2019-12-28 01:54:46,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:46,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:46,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:46,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:46,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:46,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:46,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:46,922 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-12-28 01:54:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:47,260 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-12-28 01:54:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:54:47,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:54:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:47,284 INFO L225 Difference]: With dead ends: 17386 [2019-12-28 01:54:47,285 INFO L226 Difference]: Without dead ends: 17386 [2019-12-28 01:54:47,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:54:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-12-28 01:54:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-12-28 01:54:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-12-28 01:54:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-12-28 01:54:47,503 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-12-28 01:54:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:47,503 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-12-28 01:54:47,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-12-28 01:54:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:47,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:47,516 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] [2019-12-28 01:54:47,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 202592335, now seen corresponding path program 1 times [2019-12-28 01:54:47,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:47,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486506354] [2019-12-28 01:54:47,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:54:47,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486506354] [2019-12-28 01:54:47,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:47,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:47,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980342669] [2019-12-28 01:54:47,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:47,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:47,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:47,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:47,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:47,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:47,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:47,804 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-12-28 01:54:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:48,254 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-12-28 01:54:48,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:54:48,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:54:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:48,281 INFO L225 Difference]: With dead ends: 19768 [2019-12-28 01:54:48,281 INFO L226 Difference]: Without dead ends: 19768 [2019-12-28 01:54:48,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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 01:54:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-12-28 01:54:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-12-28 01:54:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-12-28 01:54:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-12-28 01:54:48,509 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-12-28 01:54:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:48,509 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-12-28 01:54:48,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-12-28 01:54:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:48,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:48,519 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] [2019-12-28 01:54:48,519 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1604862128, now seen corresponding path program 1 times [2019-12-28 01:54:48,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:48,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747704631] [2019-12-28 01:54:48,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:48,575 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 01:54:48,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747704631] [2019-12-28 01:54:48,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:48,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:54:48,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094306250] [2019-12-28 01:54:48,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:48,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:48,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:48,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:48,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:48,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:54:48,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:54:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:54:48,608 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-12-28 01:54:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:49,155 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-12-28 01:54:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:54:49,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-28 01:54:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:49,187 INFO L225 Difference]: With dead ends: 20664 [2019-12-28 01:54:49,187 INFO L226 Difference]: Without dead ends: 20388 [2019-12-28 01:54:49,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:54:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-12-28 01:54:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-12-28 01:54:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-12-28 01:54:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-12-28 01:54:49,453 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-12-28 01:54:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:49,453 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-12-28 01:54:49,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:54:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-12-28 01:54:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:49,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:49,464 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] [2019-12-28 01:54:49,464 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 893153809, now seen corresponding path program 1 times [2019-12-28 01:54:49,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:49,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177516319] [2019-12-28 01:54:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:49,577 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 01:54:49,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177516319] [2019-12-28 01:54:49,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:49,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:54:49,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720161489] [2019-12-28 01:54:49,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:49,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:49,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:49,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:49,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:49,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:54:49,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:54:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:49,604 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-12-28 01:54:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:50,312 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-12-28 01:54:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:54:50,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-12-28 01:54:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:50,347 INFO L225 Difference]: With dead ends: 24278 [2019-12-28 01:54:50,347 INFO L226 Difference]: Without dead ends: 24278 [2019-12-28 01:54:50,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:54:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-12-28 01:54:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-12-28 01:54:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-12-28 01:54:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-12-28 01:54:50,872 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-12-28 01:54:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:50,872 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-12-28 01:54:50,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:54:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-12-28 01:54:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:54:50,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:50,889 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] [2019-12-28 01:54:50,889 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1780657490, now seen corresponding path program 1 times [2019-12-28 01:54:50,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:50,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391856194] [2019-12-28 01:54:50,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:50,988 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 01:54:50,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391856194] [2019-12-28 01:54:50,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:50,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:50,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756316598] [2019-12-28 01:54:50,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:51,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:51,014 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:54:51,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:51,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:51,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:54:51,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:51,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:54:51,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:54:51,016 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-12-28 01:54:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:51,073 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-12-28 01:54:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:54:51,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:54:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:51,081 INFO L225 Difference]: With dead ends: 6192 [2019-12-28 01:54:51,081 INFO L226 Difference]: Without dead ends: 5020 [2019-12-28 01:54:51,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:54:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-12-28 01:54:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-12-28 01:54:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-12-28 01:54:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-12-28 01:54:51,150 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-12-28 01:54:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:51,150 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-12-28 01:54:51,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:54:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-12-28 01:54:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:54:51,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:51,157 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] [2019-12-28 01:54:51,157 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -222857875, now seen corresponding path program 1 times [2019-12-28 01:54:51,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:51,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993082206] [2019-12-28 01:54:51,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:51,252 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 01:54:51,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993082206] [2019-12-28 01:54:51,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:51,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:54:51,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740740189] [2019-12-28 01:54:51,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:51,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:51,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 213 transitions. [2019-12-28 01:54:51,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:51,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:54:51,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:54:51,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:54:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:54:51,388 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 8 states. [2019-12-28 01:54:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:52,815 INFO L93 Difference]: Finished difference Result 6758 states and 15032 transitions. [2019-12-28 01:54:52,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-28 01:54:52,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 01:54:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:52,824 INFO L225 Difference]: With dead ends: 6758 [2019-12-28 01:54:52,824 INFO L226 Difference]: Without dead ends: 6705 [2019-12-28 01:54:52,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2019-12-28 01:54:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-12-28 01:54:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 5288. [2019-12-28 01:54:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5288 states. [2019-12-28 01:54:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 11882 transitions. [2019-12-28 01:54:52,883 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 11882 transitions. Word has length 86 [2019-12-28 01:54:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:52,883 INFO L462 AbstractCegarLoop]: Abstraction has 5288 states and 11882 transitions. [2019-12-28 01:54:52,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:54:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 11882 transitions. [2019-12-28 01:54:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:54:52,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:52,888 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] [2019-12-28 01:54:52,889 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1011259222, now seen corresponding path program 1 times [2019-12-28 01:54:52,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:52,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333907282] [2019-12-28 01:54:52,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:53,044 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 01:54:53,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333907282] [2019-12-28 01:54:53,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:53,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:54:53,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296184703] [2019-12-28 01:54:53,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:53,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:53,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:54:53,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:53,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:54:53,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:54:53,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:54:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:53,175 INFO L87 Difference]: Start difference. First operand 5288 states and 11882 transitions. Second operand 9 states. [2019-12-28 01:54:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:54,495 INFO L93 Difference]: Finished difference Result 16188 states and 36576 transitions. [2019-12-28 01:54:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:54:54,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 01:54:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:54,513 INFO L225 Difference]: With dead ends: 16188 [2019-12-28 01:54:54,513 INFO L226 Difference]: Without dead ends: 16134 [2019-12-28 01:54:54,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-12-28 01:54:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-12-28 01:54:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 5689. [2019-12-28 01:54:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2019-12-28 01:54:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12815 transitions. [2019-12-28 01:54:54,754 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12815 transitions. Word has length 86 [2019-12-28 01:54:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:54,754 INFO L462 AbstractCegarLoop]: Abstraction has 5689 states and 12815 transitions. [2019-12-28 01:54:54,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:54:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12815 transitions. [2019-12-28 01:54:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:54:54,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:54,763 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] [2019-12-28 01:54:54,763 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash -785692137, now seen corresponding path program 1 times [2019-12-28 01:54:54,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:54,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416135202] [2019-12-28 01:54:54,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:54,858 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 01:54:54,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416135202] [2019-12-28 01:54:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:54:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920363639] [2019-12-28 01:54:54,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:54,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:54,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:54:54,941 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:55,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 01:54:55,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:54:55,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:54:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:54:55,066 INFO L87 Difference]: Start difference. First operand 5689 states and 12815 transitions. Second operand 13 states. [2019-12-28 01:54:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:57,485 INFO L93 Difference]: Finished difference Result 19939 states and 45420 transitions. [2019-12-28 01:54:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-28 01:54:57,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 01:54:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:57,508 INFO L225 Difference]: With dead ends: 19939 [2019-12-28 01:54:57,509 INFO L226 Difference]: Without dead ends: 19939 [2019-12-28 01:54:57,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2019-12-28 01:54:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19939 states. [2019-12-28 01:54:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19939 to 6212. [2019-12-28 01:54:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2019-12-28 01:54:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14043 transitions. [2019-12-28 01:54:57,646 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14043 transitions. Word has length 86 [2019-12-28 01:54:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:57,647 INFO L462 AbstractCegarLoop]: Abstraction has 6212 states and 14043 transitions. [2019-12-28 01:54:57,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:54:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14043 transitions. [2019-12-28 01:54:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:54:57,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:57,653 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] [2019-12-28 01:54:57,653 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 101811544, now seen corresponding path program 1 times [2019-12-28 01:54:57,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:57,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912521012] [2019-12-28 01:54:57,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:57,719 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 01:54:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912521012] [2019-12-28 01:54:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:54:57,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191808457] [2019-12-28 01:54:57,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:57,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:57,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:54:57,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:57,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:54:57,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:54:57,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:57,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:54:57,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:54:57,797 INFO L87 Difference]: Start difference. First operand 6212 states and 14043 transitions. Second operand 3 states. [2019-12-28 01:54:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:57,824 INFO L93 Difference]: Finished difference Result 6122 states and 13725 transitions. [2019-12-28 01:54:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:54:57,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-28 01:54:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:57,832 INFO L225 Difference]: With dead ends: 6122 [2019-12-28 01:54:57,832 INFO L226 Difference]: Without dead ends: 6104 [2019-12-28 01:54:57,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:54:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2019-12-28 01:54:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 4109. [2019-12-28 01:54:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-12-28 01:54:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 9305 transitions. [2019-12-28 01:54:57,881 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 9305 transitions. Word has length 86 [2019-12-28 01:54:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:57,881 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 9305 transitions. [2019-12-28 01:54:57,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:54:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 9305 transitions. [2019-12-28 01:54:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:54:57,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:57,885 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] [2019-12-28 01:54:57,885 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash -751041092, now seen corresponding path program 1 times [2019-12-28 01:54:57,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:57,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137883616] [2019-12-28 01:54:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:58,024 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 01:54:58,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137883616] [2019-12-28 01:54:58,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:58,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:54:58,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723657003] [2019-12-28 01:54:58,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:58,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:58,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:54:58,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:58,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:54:58,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:54:58,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:54:58,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:54:58,141 INFO L87 Difference]: Start difference. First operand 4109 states and 9305 transitions. Second operand 9 states. [2019-12-28 01:54:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:59,250 INFO L93 Difference]: Finished difference Result 5326 states and 11862 transitions. [2019-12-28 01:54:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:54:59,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-12-28 01:54:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:59,258 INFO L225 Difference]: With dead ends: 5326 [2019-12-28 01:54:59,258 INFO L226 Difference]: Without dead ends: 5326 [2019-12-28 01:54:59,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:54:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2019-12-28 01:54:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3718. [2019-12-28 01:54:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2019-12-28 01:54:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 8375 transitions. [2019-12-28 01:54:59,303 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 8375 transitions. Word has length 88 [2019-12-28 01:54:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:59,303 INFO L462 AbstractCegarLoop]: Abstraction has 3718 states and 8375 transitions. [2019-12-28 01:54:59,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:54:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 8375 transitions. [2019-12-28 01:54:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:54:59,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:59,306 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] [2019-12-28 01:54:59,307 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 136462589, now seen corresponding path program 1 times [2019-12-28 01:54:59,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:59,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298373738] [2019-12-28 01:54:59,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:59,409 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 01:54:59,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298373738] [2019-12-28 01:54:59,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:59,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:54:59,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [477276599] [2019-12-28 01:54:59,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:59,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:54:59,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:54:59,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:54:59,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:54:59,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:54:59,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:54:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:54:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:54:59,537 INFO L87 Difference]: Start difference. First operand 3718 states and 8375 transitions. Second operand 8 states. [2019-12-28 01:54:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:54:59,686 INFO L93 Difference]: Finished difference Result 6312 states and 14300 transitions. [2019-12-28 01:54:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:54:59,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-28 01:54:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:54:59,692 INFO L225 Difference]: With dead ends: 6312 [2019-12-28 01:54:59,692 INFO L226 Difference]: Without dead ends: 2686 [2019-12-28 01:54:59,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:54:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-28 01:54:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2019-12-28 01:54:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2019-12-28 01:54:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 6074 transitions. [2019-12-28 01:54:59,746 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 6074 transitions. Word has length 88 [2019-12-28 01:54:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:54:59,747 INFO L462 AbstractCegarLoop]: Abstraction has 2686 states and 6074 transitions. [2019-12-28 01:54:59,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:54:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 6074 transitions. [2019-12-28 01:54:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:54:59,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:54:59,751 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] [2019-12-28 01:54:59,751 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:54:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:54:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1710229601, now seen corresponding path program 2 times [2019-12-28 01:54:59,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:54:59,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324874556] [2019-12-28 01:54:59,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:54:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:54:59,982 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 01:54:59,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324874556] [2019-12-28 01:54:59,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:54:59,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:54:59,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895452115] [2019-12-28 01:54:59,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:54:59,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:00,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 160 transitions. [2019-12-28 01:55:00,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:00,088 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:55:00,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:55:00,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:00,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:55:00,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:55:00,089 INFO L87 Difference]: Start difference. First operand 2686 states and 6074 transitions. Second operand 11 states. [2019-12-28 01:55:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:01,182 INFO L93 Difference]: Finished difference Result 5002 states and 11285 transitions. [2019-12-28 01:55:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 01:55:01,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-12-28 01:55:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:01,189 INFO L225 Difference]: With dead ends: 5002 [2019-12-28 01:55:01,189 INFO L226 Difference]: Without dead ends: 3353 [2019-12-28 01:55:01,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-28 01:55:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-12-28 01:55:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2733. [2019-12-28 01:55:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2733 states. [2019-12-28 01:55:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 6115 transitions. [2019-12-28 01:55:01,244 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 6115 transitions. Word has length 88 [2019-12-28 01:55:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:01,244 INFO L462 AbstractCegarLoop]: Abstraction has 2733 states and 6115 transitions. [2019-12-28 01:55:01,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:55:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 6115 transitions. [2019-12-28 01:55:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:55:01,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:01,250 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] [2019-12-28 01:55:01,250 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1220418877, now seen corresponding path program 3 times [2019-12-28 01:55:01,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:01,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838181740] [2019-12-28 01:55:01,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:55:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:55:01,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:55:01,415 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:55:01,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:55:01 BasicIcfg [2019-12-28 01:55:01,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:55:01,705 INFO L168 Benchmark]: Toolchain (without parser) took 46761.42 ms. Allocated memory was 138.9 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 101.6 MB in the beginning and 931.7 MB in the end (delta: -830.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,707 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.90 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 156.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.08 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,713 INFO L168 Benchmark]: Boogie Preprocessor took 36.86 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,714 INFO L168 Benchmark]: RCFGBuilder took 743.97 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 110.8 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,714 INFO L168 Benchmark]: TraceAbstraction took 45049.89 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 110.1 MB in the beginning and 931.7 MB in the end (delta: -821.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 01:55:01,721 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.90 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.4 MB in the beginning and 156.9 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.08 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.86 ms. Allocated memory is still 204.5 MB. Free memory was 154.2 MB in the beginning and 152.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.97 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 110.8 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45049.89 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 110.1 MB in the beginning and 931.7 MB in the end (delta: -821.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L809] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L787] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=0, y$r_buff0_thd2=1, 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, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L818] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L818] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L818] 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) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L820] 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L822] 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 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, 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=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7395 SDtfs, 11406 SDslu, 19368 SDs, 0 SdLazy, 8850 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 145 SyntacticMatches, 13 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 77263 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 321557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...