/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/safe033_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 05:26:44,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 05:26:44,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 05:26:44,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 05:26:44,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 05:26:44,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 05:26:44,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 05:26:44,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 05:26:44,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 05:26:44,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 05:26:44,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 05:26:44,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 05:26:44,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 05:26:44,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 05:26:44,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 05:26:44,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 05:26:44,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 05:26:44,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 05:26:44,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 05:26:44,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 05:26:44,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 05:26:44,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 05:26:44,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 05:26:44,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 05:26:44,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 05:26:44,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 05:26:44,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 05:26:44,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 05:26:44,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 05:26:44,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 05:26:44,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 05:26:44,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 05:26:44,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 05:26:44,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 05:26:44,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 05:26:44,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 05:26:44,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 05:26:44,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 05:26:44,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 05:26:44,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 05:26:44,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 05:26:44,732 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 05:26:44,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 05:26:44,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 05:26:44,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 05:26:44,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 05:26:44,750 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 05:26:44,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 05:26:44,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 05:26:44,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 05:26:44,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 05:26:44,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 05:26:44,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 05:26:44,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 05:26:44,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 05:26:44,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 05:26:44,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 05:26:44,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 05:26:44,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 05:26:44,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 05:26:44,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 05:26:44,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 05:26:44,761 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 05:26:44,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 05:26:45,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 05:26:45,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 05:26:45,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 05:26:45,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 05:26:45,138 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 05:26:45,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-28 05:26:45,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9da7125/06bce7a597c34a7e9b834c6b4bb0885f/FLAG6abdb77ad [2019-12-28 05:26:45,709 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 05:26:45,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-28 05:26:45,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9da7125/06bce7a597c34a7e9b834c6b4bb0885f/FLAG6abdb77ad [2019-12-28 05:26:45,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9da7125/06bce7a597c34a7e9b834c6b4bb0885f [2019-12-28 05:26:45,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 05:26:45,979 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 05:26:45,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 05:26:45,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 05:26:45,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 05:26:45,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:26:45" (1/1) ... [2019-12-28 05:26:45,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10620d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:45, skipping insertion in model container [2019-12-28 05:26:45,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:26:45" (1/1) ... [2019-12-28 05:26:45,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 05:26:46,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 05:26:46,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:26:46,655 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 05:26:46,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 05:26:46,815 INFO L208 MainTranslator]: Completed translation [2019-12-28 05:26:46,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46 WrapperNode [2019-12-28 05:26:46,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 05:26:46,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 05:26:46,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 05:26:46,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 05:26:46,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 05:26:46,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 05:26:46,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 05:26:46,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 05:26:46,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (1/1) ... [2019-12-28 05:26:46,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 05:26:46,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 05:26:46,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 05:26:46,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 05:26:46,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (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 05:26:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 05:26:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 05:26:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 05:26:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 05:26:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 05:26:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 05:26:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 05:26:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 05:26:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 05:26:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 05:26:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 05:26:46,998 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 05:26:47,700 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 05:26:47,701 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 05:26:47,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:26:47 BoogieIcfgContainer [2019-12-28 05:26:47,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 05:26:47,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 05:26:47,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 05:26:47,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 05:26:47,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:26:45" (1/3) ... [2019-12-28 05:26:47,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b7335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:26:47, skipping insertion in model container [2019-12-28 05:26:47,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:26:46" (2/3) ... [2019-12-28 05:26:47,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b7335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:26:47, skipping insertion in model container [2019-12-28 05:26:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:26:47" (3/3) ... [2019-12-28 05:26:47,717 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-28 05:26:47,729 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 05:26:47,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 05:26:47,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 05:26:47,740 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 05:26:47,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,790 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,791 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 05:26:47,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 05:26:47,874 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 05:26:47,874 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 05:26:47,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 05:26:47,874 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 05:26:47,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 05:26:47,875 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 05:26:47,875 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 05:26:47,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 05:26:47,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 162 transitions [2019-12-28 05:26:49,631 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-12-28 05:26:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-12-28 05:26:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-28 05:26:49,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:26:49,643 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] [2019-12-28 05:26:49,644 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:26:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:26:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash 310103372, now seen corresponding path program 1 times [2019-12-28 05:26:49,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:26:49,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690451442] [2019-12-28 05:26:49,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:26:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:26:50,010 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 05:26:50,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690451442] [2019-12-28 05:26:50,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:26:50,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:26:50,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481345694] [2019-12-28 05:26:50,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:26:50,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:26:50,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-28 05:26:50,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:26:50,049 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:26:50,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:26:50,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:26:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:26:50,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:26:50,068 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-12-28 05:26:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:26:50,652 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-12-28 05:26:50,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:26:50,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-28 05:26:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:26:50,883 INFO L225 Difference]: With dead ends: 26614 [2019-12-28 05:26:50,883 INFO L226 Difference]: Without dead ends: 20358 [2019-12-28 05:26:50,887 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 05:26:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-12-28 05:26:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-12-28 05:26:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-12-28 05:26:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-12-28 05:26:52,818 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-12-28 05:26:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:26:52,820 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-12-28 05:26:52,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:26:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-12-28 05:26:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 05:26:52,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:26:52,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:26:52,835 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:26:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:26:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2127220543, now seen corresponding path program 1 times [2019-12-28 05:26:52,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:26:52,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408878996] [2019-12-28 05:26:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:26:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:26:53,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 05:26:53,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408878996] [2019-12-28 05:26:53,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:26:53,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:26:53,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093733780] [2019-12-28 05:26:53,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:26:53,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:26:53,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 05:26:53,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:26:53,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:26:53,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:26:53,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:26:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:26:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:26:53,028 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-12-28 05:26:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:26:54,878 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-12-28 05:26:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:26:54,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 05:26:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:26:55,036 INFO L225 Difference]: With dead ends: 31836 [2019-12-28 05:26:55,037 INFO L226 Difference]: Without dead ends: 31284 [2019-12-28 05:26:55,038 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 05:26:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-12-28 05:26:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-12-28 05:26:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-12-28 05:26:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-12-28 05:26:56,153 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-12-28 05:26:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:26:56,155 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-12-28 05:26:56,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:26:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-12-28 05:26:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 05:26:56,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:26:56,166 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] [2019-12-28 05:26:56,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:26:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:26:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash -370499147, now seen corresponding path program 1 times [2019-12-28 05:26:56,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:26:56,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037935545] [2019-12-28 05:26:56,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:26:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:26:56,266 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 05:26:56,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037935545] [2019-12-28 05:26:56,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:26:56,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:26:56,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28042496] [2019-12-28 05:26:56,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:26:56,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:26:56,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 118 transitions. [2019-12-28 05:26:56,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:26:56,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:26:56,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:26:56,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:26:56,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:26:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:26:56,292 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-12-28 05:26:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:26:56,854 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-12-28 05:26:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:26:56,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 05:26:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:26:57,314 INFO L225 Difference]: With dead ends: 38694 [2019-12-28 05:26:57,314 INFO L226 Difference]: Without dead ends: 38246 [2019-12-28 05:26:57,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 05:26:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-12-28 05:26:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-12-28 05:26:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-12-28 05:26:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-12-28 05:26:59,678 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-12-28 05:26:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:26:59,678 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-12-28 05:26:59,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:26:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-12-28 05:26:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 05:26:59,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:26:59,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:26:59,686 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:26:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:26:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1101725263, now seen corresponding path program 1 times [2019-12-28 05:26:59,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:26:59,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249890224] [2019-12-28 05:26:59,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:26:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:26:59,735 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 05:26:59,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249890224] [2019-12-28 05:26:59,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:26:59,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:26:59,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138180712] [2019-12-28 05:26:59,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:26:59,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:26:59,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 136 transitions. [2019-12-28 05:26:59,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:26:59,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:26:59,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:26:59,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:26:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:26:59,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:26:59,756 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-12-28 05:27:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:00,022 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-12-28 05:27:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:00,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-28 05:27:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:00,122 INFO L225 Difference]: With dead ends: 42410 [2019-12-28 05:27:00,123 INFO L226 Difference]: Without dead ends: 42410 [2019-12-28 05:27:00,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:27:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-12-28 05:27:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-12-28 05:27:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-12-28 05:27:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-12-28 05:27:01,255 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-12-28 05:27:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:01,255 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-12-28 05:27:01,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-12-28 05:27:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:01,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:01,273 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] [2019-12-28 05:27:01,273 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:01,273 INFO L82 PathProgramCache]: Analyzing trace with hash -929169210, now seen corresponding path program 1 times [2019-12-28 05:27:01,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:01,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996907893] [2019-12-28 05:27:01,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:01,373 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 05:27:01,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996907893] [2019-12-28 05:27:01,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:01,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:01,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123233525] [2019-12-28 05:27:01,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:01,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:01,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 172 transitions. [2019-12-28 05:27:01,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:01,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:01,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 05:27:01,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 05:27:01,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:01,484 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 8 states. [2019-12-28 05:27:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:02,671 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-12-28 05:27:02,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 05:27:02,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-28 05:27:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:02,902 INFO L225 Difference]: With dead ends: 48754 [2019-12-28 05:27:02,902 INFO L226 Difference]: Without dead ends: 48234 [2019-12-28 05:27:02,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 05:27:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-12-28 05:27:03,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-12-28 05:27:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-12-28 05:27:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-12-28 05:27:06,120 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-12-28 05:27:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:06,121 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-12-28 05:27:06,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 05:27:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-12-28 05:27:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:06,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:06,143 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] [2019-12-28 05:27:06,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2144383564, now seen corresponding path program 1 times [2019-12-28 05:27:06,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:06,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795505345] [2019-12-28 05:27:06,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:06,281 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 05:27:06,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795505345] [2019-12-28 05:27:06,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:06,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082614200] [2019-12-28 05:27:06,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:06,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:06,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:06,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:06,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:06,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:06,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:06,302 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-12-28 05:27:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:07,145 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-12-28 05:27:07,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:07,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 05:27:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:07,283 INFO L225 Difference]: With dead ends: 53003 [2019-12-28 05:27:07,284 INFO L226 Difference]: Without dead ends: 52027 [2019-12-28 05:27:07,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-12-28 05:27:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-12-28 05:27:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-12-28 05:27:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-12-28 05:27:08,494 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-12-28 05:27:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:08,495 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-12-28 05:27:08,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-12-28 05:27:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:08,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:08,515 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] [2019-12-28 05:27:08,515 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash 347432205, now seen corresponding path program 1 times [2019-12-28 05:27:08,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:08,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714104255] [2019-12-28 05:27:08,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:08,626 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 05:27:08,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714104255] [2019-12-28 05:27:08,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:08,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:08,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672708505] [2019-12-28 05:27:08,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:08,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:08,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:08,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:08,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:08,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:08,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:08,643 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-12-28 05:27:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:09,772 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-12-28 05:27:09,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:09,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 05:27:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:10,507 INFO L225 Difference]: With dead ends: 70895 [2019-12-28 05:27:10,507 INFO L226 Difference]: Without dead ends: 70895 [2019-12-28 05:27:10,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-12-28 05:27:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-12-28 05:27:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-28 05:27:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-12-28 05:27:14,498 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-12-28 05:27:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:14,498 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-12-28 05:27:14,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-12-28 05:27:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 05:27:14,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:14,512 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] [2019-12-28 05:27:14,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1234935886, now seen corresponding path program 1 times [2019-12-28 05:27:14,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:14,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536300402] [2019-12-28 05:27:14,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:14,569 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 05:27:14,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536300402] [2019-12-28 05:27:14,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:14,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:27:14,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529658853] [2019-12-28 05:27:14,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:14,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:14,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 56 transitions. [2019-12-28 05:27:14,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:14,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:14,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:27:14,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:27:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:14,583 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 3 states. [2019-12-28 05:27:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:14,773 INFO L93 Difference]: Finished difference Result 43854 states and 152831 transitions. [2019-12-28 05:27:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:14,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-28 05:27:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:14,860 INFO L225 Difference]: With dead ends: 43854 [2019-12-28 05:27:14,861 INFO L226 Difference]: Without dead ends: 43350 [2019-12-28 05:27:14,861 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 05:27:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43350 states. [2019-12-28 05:27:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43350 to 41884. [2019-12-28 05:27:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41884 states. [2019-12-28 05:27:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41884 states to 41884 states and 146702 transitions. [2019-12-28 05:27:15,612 INFO L78 Accepts]: Start accepts. Automaton has 41884 states and 146702 transitions. Word has length 52 [2019-12-28 05:27:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:15,612 INFO L462 AbstractCegarLoop]: Abstraction has 41884 states and 146702 transitions. [2019-12-28 05:27:15,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 41884 states and 146702 transitions. [2019-12-28 05:27:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 05:27:15,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:15,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:15,623 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash 696034008, now seen corresponding path program 1 times [2019-12-28 05:27:15,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:15,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574957235] [2019-12-28 05:27:15,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:15,724 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 05:27:15,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574957235] [2019-12-28 05:27:15,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:15,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:15,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073839134] [2019-12-28 05:27:15,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:15,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:15,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 05:27:15,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:15,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:15,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:15,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:15,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:15,738 INFO L87 Difference]: Start difference. First operand 41884 states and 146702 transitions. Second operand 6 states. [2019-12-28 05:27:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:16,804 INFO L93 Difference]: Finished difference Result 54547 states and 184832 transitions. [2019-12-28 05:27:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:16,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 05:27:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:16,912 INFO L225 Difference]: With dead ends: 54547 [2019-12-28 05:27:16,912 INFO L226 Difference]: Without dead ends: 54547 [2019-12-28 05:27:16,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54547 states. [2019-12-28 05:27:17,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54547 to 45859. [2019-12-28 05:27:17,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45859 states. [2019-12-28 05:27:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45859 states to 45859 states and 158165 transitions. [2019-12-28 05:27:17,778 INFO L78 Accepts]: Start accepts. Automaton has 45859 states and 158165 transitions. Word has length 53 [2019-12-28 05:27:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:17,778 INFO L462 AbstractCegarLoop]: Abstraction has 45859 states and 158165 transitions. [2019-12-28 05:27:17,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 45859 states and 158165 transitions. [2019-12-28 05:27:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 05:27:17,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:17,789 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 05:27:17,789 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1583537689, now seen corresponding path program 1 times [2019-12-28 05:27:17,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:17,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001420562] [2019-12-28 05:27:17,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:17,871 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 05:27:17,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001420562] [2019-12-28 05:27:17,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:17,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:17,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677217524] [2019-12-28 05:27:17,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:17,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:17,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 05:27:17,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:17,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:17,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:17,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:17,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:17,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:17,886 INFO L87 Difference]: Start difference. First operand 45859 states and 158165 transitions. Second operand 4 states. [2019-12-28 05:27:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:17,940 INFO L93 Difference]: Finished difference Result 8161 states and 24869 transitions. [2019-12-28 05:27:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:17,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-28 05:27:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:17,954 INFO L225 Difference]: With dead ends: 8161 [2019-12-28 05:27:17,954 INFO L226 Difference]: Without dead ends: 6752 [2019-12-28 05:27:17,954 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 05:27:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-12-28 05:27:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6704. [2019-12-28 05:27:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6704 states. [2019-12-28 05:27:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6704 states to 6704 states and 20038 transitions. [2019-12-28 05:27:18,363 INFO L78 Accepts]: Start accepts. Automaton has 6704 states and 20038 transitions. Word has length 53 [2019-12-28 05:27:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:18,363 INFO L462 AbstractCegarLoop]: Abstraction has 6704 states and 20038 transitions. [2019-12-28 05:27:18,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6704 states and 20038 transitions. [2019-12-28 05:27:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:27:18,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:18,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:18,367 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1215430140, now seen corresponding path program 1 times [2019-12-28 05:27:18,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:18,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866885922] [2019-12-28 05:27:18,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:18,430 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 05:27:18,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866885922] [2019-12-28 05:27:18,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:18,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:18,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378190145] [2019-12-28 05:27:18,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:18,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:18,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:27:18,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:18,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:18,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:18,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:18,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:18,474 INFO L87 Difference]: Start difference. First operand 6704 states and 20038 transitions. Second operand 4 states. [2019-12-28 05:27:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:18,616 INFO L93 Difference]: Finished difference Result 7889 states and 23387 transitions. [2019-12-28 05:27:18,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:18,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-28 05:27:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:18,634 INFO L225 Difference]: With dead ends: 7889 [2019-12-28 05:27:18,634 INFO L226 Difference]: Without dead ends: 7889 [2019-12-28 05:27:18,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2019-12-28 05:27:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 7211. [2019-12-28 05:27:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-28 05:27:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 21444 transitions. [2019-12-28 05:27:18,773 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 21444 transitions. Word has length 62 [2019-12-28 05:27:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:18,773 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 21444 transitions. [2019-12-28 05:27:18,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 21444 transitions. [2019-12-28 05:27:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 05:27:18,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:18,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:18,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1336726821, now seen corresponding path program 1 times [2019-12-28 05:27:18,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:18,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167806798] [2019-12-28 05:27:18,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:18,904 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 05:27:18,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167806798] [2019-12-28 05:27:18,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:18,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:18,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326801836] [2019-12-28 05:27:18,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:18,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:18,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 198 transitions. [2019-12-28 05:27:18,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:18,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 05:27:18,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:18,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:18,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:18,956 INFO L87 Difference]: Start difference. First operand 7211 states and 21444 transitions. Second operand 6 states. [2019-12-28 05:27:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:19,377 INFO L93 Difference]: Finished difference Result 9266 states and 27193 transitions. [2019-12-28 05:27:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:19,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 05:27:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:19,396 INFO L225 Difference]: With dead ends: 9266 [2019-12-28 05:27:19,397 INFO L226 Difference]: Without dead ends: 9218 [2019-12-28 05:27:19,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:27:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9218 states. [2019-12-28 05:27:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9218 to 8050. [2019-12-28 05:27:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8050 states. [2019-12-28 05:27:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 23824 transitions. [2019-12-28 05:27:19,552 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 23824 transitions. Word has length 62 [2019-12-28 05:27:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:19,553 INFO L462 AbstractCegarLoop]: Abstraction has 8050 states and 23824 transitions. [2019-12-28 05:27:19,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 23824 transitions. [2019-12-28 05:27:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:19,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:19,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:19,560 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1328482933, now seen corresponding path program 1 times [2019-12-28 05:27:19,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:19,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355998766] [2019-12-28 05:27:19,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:19,598 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 05:27:19,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355998766] [2019-12-28 05:27:19,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:19,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 05:27:19,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137013231] [2019-12-28 05:27:19,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:19,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:19,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:19,623 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:19,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:19,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 05:27:19,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 05:27:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 05:27:19,624 INFO L87 Difference]: Start difference. First operand 8050 states and 23824 transitions. Second operand 3 states. [2019-12-28 05:27:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:19,791 INFO L93 Difference]: Finished difference Result 8598 states and 25230 transitions. [2019-12-28 05:27:19,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 05:27:19,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-28 05:27:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:19,806 INFO L225 Difference]: With dead ends: 8598 [2019-12-28 05:27:19,807 INFO L226 Difference]: Without dead ends: 8598 [2019-12-28 05:27:19,807 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 05:27:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2019-12-28 05:27:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8326. [2019-12-28 05:27:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-12-28 05:27:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 24532 transitions. [2019-12-28 05:27:19,934 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 24532 transitions. Word has length 66 [2019-12-28 05:27:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:19,934 INFO L462 AbstractCegarLoop]: Abstraction has 8326 states and 24532 transitions. [2019-12-28 05:27:19,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 05:27:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 24532 transitions. [2019-12-28 05:27:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:19,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:19,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:19,941 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2004870346, now seen corresponding path program 1 times [2019-12-28 05:27:19,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:19,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064213737] [2019-12-28 05:27:19,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:20,013 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 05:27:20,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064213737] [2019-12-28 05:27:20,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:20,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:20,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184488702] [2019-12-28 05:27:20,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:20,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:20,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:20,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:20,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:20,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:20,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:20,040 INFO L87 Difference]: Start difference. First operand 8326 states and 24532 transitions. Second operand 4 states. [2019-12-28 05:27:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:20,299 INFO L93 Difference]: Finished difference Result 10939 states and 31881 transitions. [2019-12-28 05:27:20,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 05:27:20,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 05:27:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:20,316 INFO L225 Difference]: With dead ends: 10939 [2019-12-28 05:27:20,317 INFO L226 Difference]: Without dead ends: 10939 [2019-12-28 05:27:20,317 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 05:27:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10939 states. [2019-12-28 05:27:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10939 to 9349. [2019-12-28 05:27:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9349 states. [2019-12-28 05:27:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 27351 transitions. [2019-12-28 05:27:20,442 INFO L78 Accepts]: Start accepts. Automaton has 9349 states and 27351 transitions. Word has length 66 [2019-12-28 05:27:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:20,442 INFO L462 AbstractCegarLoop]: Abstraction has 9349 states and 27351 transitions. [2019-12-28 05:27:20,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 9349 states and 27351 transitions. [2019-12-28 05:27:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:20,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:20,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:20,451 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1045332469, now seen corresponding path program 1 times [2019-12-28 05:27:20,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:20,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399492440] [2019-12-28 05:27:20,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:20,541 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 05:27:20,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399492440] [2019-12-28 05:27:20,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:20,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:20,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070963303] [2019-12-28 05:27:20,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:20,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:20,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:20,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:20,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:20,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:20,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:20,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:20,567 INFO L87 Difference]: Start difference. First operand 9349 states and 27351 transitions. Second operand 6 states. [2019-12-28 05:27:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:21,122 INFO L93 Difference]: Finished difference Result 10523 states and 30248 transitions. [2019-12-28 05:27:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 05:27:21,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:27:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:21,140 INFO L225 Difference]: With dead ends: 10523 [2019-12-28 05:27:21,140 INFO L226 Difference]: Without dead ends: 10523 [2019-12-28 05:27:21,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 05:27:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2019-12-28 05:27:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10080. [2019-12-28 05:27:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10080 states. [2019-12-28 05:27:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10080 states to 10080 states and 29117 transitions. [2019-12-28 05:27:21,275 INFO L78 Accepts]: Start accepts. Automaton has 10080 states and 29117 transitions. Word has length 66 [2019-12-28 05:27:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:21,275 INFO L462 AbstractCegarLoop]: Abstraction has 10080 states and 29117 transitions. [2019-12-28 05:27:21,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10080 states and 29117 transitions. [2019-12-28 05:27:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:21,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:21,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:21,290 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1172425484, now seen corresponding path program 1 times [2019-12-28 05:27:21,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:21,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850580782] [2019-12-28 05:27:21,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:21,426 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 05:27:21,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850580782] [2019-12-28 05:27:21,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:21,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105676524] [2019-12-28 05:27:21,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:21,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:21,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:21,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:21,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:21,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 05:27:21,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 05:27:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 05:27:21,452 INFO L87 Difference]: Start difference. First operand 10080 states and 29117 transitions. Second operand 6 states. [2019-12-28 05:27:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:21,912 INFO L93 Difference]: Finished difference Result 11997 states and 33624 transitions. [2019-12-28 05:27:21,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 05:27:21,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 05:27:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:21,927 INFO L225 Difference]: With dead ends: 11997 [2019-12-28 05:27:21,927 INFO L226 Difference]: Without dead ends: 11997 [2019-12-28 05:27:21,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:27:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11997 states. [2019-12-28 05:27:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11997 to 10299. [2019-12-28 05:27:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10299 states. [2019-12-28 05:27:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10299 states to 10299 states and 29169 transitions. [2019-12-28 05:27:22,062 INFO L78 Accepts]: Start accepts. Automaton has 10299 states and 29169 transitions. Word has length 66 [2019-12-28 05:27:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:22,062 INFO L462 AbstractCegarLoop]: Abstraction has 10299 states and 29169 transitions. [2019-12-28 05:27:22,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 05:27:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 10299 states and 29169 transitions. [2019-12-28 05:27:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:22,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:22,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:22,070 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1383776397, now seen corresponding path program 1 times [2019-12-28 05:27:22,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:22,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993625747] [2019-12-28 05:27:22,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:22,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 05:27:22,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993625747] [2019-12-28 05:27:22,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:22,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:22,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248117281] [2019-12-28 05:27:22,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:22,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:22,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:22,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:22,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:22,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:22,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:22,151 INFO L87 Difference]: Start difference. First operand 10299 states and 29169 transitions. Second operand 5 states. [2019-12-28 05:27:22,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:22,523 INFO L93 Difference]: Finished difference Result 12574 states and 35462 transitions. [2019-12-28 05:27:22,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:27:22,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:27:22,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:22,545 INFO L225 Difference]: With dead ends: 12574 [2019-12-28 05:27:22,545 INFO L226 Difference]: Without dead ends: 12574 [2019-12-28 05:27:22,546 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 05:27:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2019-12-28 05:27:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 11074. [2019-12-28 05:27:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-28 05:27:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 31103 transitions. [2019-12-28 05:27:22,689 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 31103 transitions. Word has length 66 [2019-12-28 05:27:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:22,689 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 31103 transitions. [2019-12-28 05:27:22,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 31103 transitions. [2019-12-28 05:27:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:22,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:22,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:22,696 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 873242220, now seen corresponding path program 1 times [2019-12-28 05:27:22,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:22,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937230499] [2019-12-28 05:27:22,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:22,758 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 05:27:22,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937230499] [2019-12-28 05:27:22,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:22,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 05:27:22,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192611516] [2019-12-28 05:27:22,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:22,769 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:22,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:22,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:22,783 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 05:27:22,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 05:27:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 05:27:22,784 INFO L87 Difference]: Start difference. First operand 11074 states and 31103 transitions. Second operand 4 states. [2019-12-28 05:27:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:23,250 INFO L93 Difference]: Finished difference Result 13630 states and 38378 transitions. [2019-12-28 05:27:23,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 05:27:23,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 05:27:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:23,272 INFO L225 Difference]: With dead ends: 13630 [2019-12-28 05:27:23,273 INFO L226 Difference]: Without dead ends: 13255 [2019-12-28 05:27:23,273 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 05:27:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2019-12-28 05:27:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 12712. [2019-12-28 05:27:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12712 states. [2019-12-28 05:27:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12712 states to 12712 states and 35687 transitions. [2019-12-28 05:27:23,436 INFO L78 Accepts]: Start accepts. Automaton has 12712 states and 35687 transitions. Word has length 66 [2019-12-28 05:27:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:23,437 INFO L462 AbstractCegarLoop]: Abstraction has 12712 states and 35687 transitions. [2019-12-28 05:27:23,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 05:27:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12712 states and 35687 transitions. [2019-12-28 05:27:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:23,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:23,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:23,445 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash -923709139, now seen corresponding path program 1 times [2019-12-28 05:27:23,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:23,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876270361] [2019-12-28 05:27:23,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:23,590 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 05:27:23,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876270361] [2019-12-28 05:27:23,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:23,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:23,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381671201] [2019-12-28 05:27:23,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:23,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:23,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:23,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:23,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:23,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:23,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:23,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:23,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:23,614 INFO L87 Difference]: Start difference. First operand 12712 states and 35687 transitions. Second operand 7 states. [2019-12-28 05:27:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:24,070 INFO L93 Difference]: Finished difference Result 15474 states and 42652 transitions. [2019-12-28 05:27:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 05:27:24,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 05:27:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:24,091 INFO L225 Difference]: With dead ends: 15474 [2019-12-28 05:27:24,092 INFO L226 Difference]: Without dead ends: 15474 [2019-12-28 05:27:24,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 05:27:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15474 states. [2019-12-28 05:27:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15474 to 12108. [2019-12-28 05:27:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12108 states. [2019-12-28 05:27:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12108 states to 12108 states and 33423 transitions. [2019-12-28 05:27:24,265 INFO L78 Accepts]: Start accepts. Automaton has 12108 states and 33423 transitions. Word has length 66 [2019-12-28 05:27:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:24,265 INFO L462 AbstractCegarLoop]: Abstraction has 12108 states and 33423 transitions. [2019-12-28 05:27:24,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12108 states and 33423 transitions. [2019-12-28 05:27:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 05:27:24,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:24,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 05:27:24,273 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -36205458, now seen corresponding path program 1 times [2019-12-28 05:27:24,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:24,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025607655] [2019-12-28 05:27:24,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:24,406 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 05:27:24,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025607655] [2019-12-28 05:27:24,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:24,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:24,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344063838] [2019-12-28 05:27:24,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:24,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:24,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 05:27:24,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:24,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 05:27:24,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 05:27:24,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 05:27:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 05:27:24,436 INFO L87 Difference]: Start difference. First operand 12108 states and 33423 transitions. Second operand 5 states. [2019-12-28 05:27:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:24,485 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-12-28 05:27:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 05:27:24,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 05:27:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:24,490 INFO L225 Difference]: With dead ends: 4023 [2019-12-28 05:27:24,490 INFO L226 Difference]: Without dead ends: 3350 [2019-12-28 05:27:24,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-12-28 05:27:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-12-28 05:27:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-12-28 05:27:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-12-28 05:27:24,537 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-12-28 05:27:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:24,538 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-12-28 05:27:24,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 05:27:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-12-28 05:27:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:24,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:24,543 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] [2019-12-28 05:27:24,543 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1721997520, now seen corresponding path program 1 times [2019-12-28 05:27:24,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:24,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939887320] [2019-12-28 05:27:24,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:24,683 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 05:27:24,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939887320] [2019-12-28 05:27:24,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:24,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 05:27:24,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886802721] [2019-12-28 05:27:24,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:24,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:24,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:27:24,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:24,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 05:27:24,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 05:27:24,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 05:27:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:24,836 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 10 states. [2019-12-28 05:27:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:26,236 INFO L93 Difference]: Finished difference Result 6377 states and 14423 transitions. [2019-12-28 05:27:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 05:27:26,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-28 05:27:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:26,245 INFO L225 Difference]: With dead ends: 6377 [2019-12-28 05:27:26,245 INFO L226 Difference]: Without dead ends: 6330 [2019-12-28 05:27:26,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-28 05:27:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2019-12-28 05:27:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 3414. [2019-12-28 05:27:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2019-12-28 05:27:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 7811 transitions. [2019-12-28 05:27:26,295 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 7811 transitions. Word has length 83 [2019-12-28 05:27:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:26,295 INFO L462 AbstractCegarLoop]: Abstraction has 3414 states and 7811 transitions. [2019-12-28 05:27:26,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 05:27:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 7811 transitions. [2019-12-28 05:27:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:26,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:26,298 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] [2019-12-28 05:27:26,299 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -355211823, now seen corresponding path program 1 times [2019-12-28 05:27:26,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:26,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013148628] [2019-12-28 05:27:26,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:26,393 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 05:27:26,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013148628] [2019-12-28 05:27:26,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:26,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:26,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165567860] [2019-12-28 05:27:26,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:26,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:26,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 281 transitions. [2019-12-28 05:27:26,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:26,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 05:27:26,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 05:27:26,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:26,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 05:27:26,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 05:27:26,528 INFO L87 Difference]: Start difference. First operand 3414 states and 7811 transitions. Second operand 7 states. [2019-12-28 05:27:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:26,653 INFO L93 Difference]: Finished difference Result 5783 states and 13274 transitions. [2019-12-28 05:27:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 05:27:26,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 05:27:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:26,658 INFO L225 Difference]: With dead ends: 5783 [2019-12-28 05:27:26,659 INFO L226 Difference]: Without dead ends: 2442 [2019-12-28 05:27:26,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-28 05:27:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-28 05:27:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2401. [2019-12-28 05:27:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-28 05:27:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 5493 transitions. [2019-12-28 05:27:26,712 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 5493 transitions. Word has length 83 [2019-12-28 05:27:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:26,713 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 5493 transitions. [2019-12-28 05:27:26,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 05:27:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 5493 transitions. [2019-12-28 05:27:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:26,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:26,719 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] [2019-12-28 05:27:26,720 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2146119358, now seen corresponding path program 1 times [2019-12-28 05:27:26,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:26,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293594690] [2019-12-28 05:27:26,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:26,810 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 05:27:26,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293594690] [2019-12-28 05:27:26,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:26,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 05:27:26,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [15132631] [2019-12-28 05:27:26,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:26,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:26,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 175 transitions. [2019-12-28 05:27:26,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:27,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:27,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 05:27:27,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:27,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 05:27:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 05:27:27,083 INFO L87 Difference]: Start difference. First operand 2401 states and 5493 transitions. Second operand 9 states. [2019-12-28 05:27:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:27,641 INFO L93 Difference]: Finished difference Result 2583 states and 5664 transitions. [2019-12-28 05:27:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 05:27:27,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-12-28 05:27:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:27,646 INFO L225 Difference]: With dead ends: 2583 [2019-12-28 05:27:27,646 INFO L226 Difference]: Without dead ends: 2583 [2019-12-28 05:27:27,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-28 05:27:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1724. [2019-12-28 05:27:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-28 05:27:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3736 transitions. [2019-12-28 05:27:27,665 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3736 transitions. Word has length 83 [2019-12-28 05:27:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:27,666 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3736 transitions. [2019-12-28 05:27:27,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 05:27:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3736 transitions. [2019-12-28 05:27:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:27,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:27,667 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] [2019-12-28 05:27:27,667 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:27,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1743706764, now seen corresponding path program 2 times [2019-12-28 05:27:27,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:27,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442356147] [2019-12-28 05:27:27,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:27,788 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 05:27:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442356147] [2019-12-28 05:27:27,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:27,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 05:27:27,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810509023] [2019-12-28 05:27:27,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:27,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:27,879 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:27:27,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:28,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 05:27:28,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:27:28,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:27:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:28,039 INFO L87 Difference]: Start difference. First operand 1724 states and 3736 transitions. Second operand 13 states. [2019-12-28 05:27:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:29,412 INFO L93 Difference]: Finished difference Result 2754 states and 5950 transitions. [2019-12-28 05:27:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 05:27:29,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:27:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:29,416 INFO L225 Difference]: With dead ends: 2754 [2019-12-28 05:27:29,417 INFO L226 Difference]: Without dead ends: 2706 [2019-12-28 05:27:29,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2019-12-28 05:27:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-12-28 05:27:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1653. [2019-12-28 05:27:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-12-28 05:27:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3543 transitions. [2019-12-28 05:27:29,438 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3543 transitions. Word has length 83 [2019-12-28 05:27:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:29,438 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 3543 transitions. [2019-12-28 05:27:29,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:27:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3543 transitions. [2019-12-28 05:27:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:29,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:29,440 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] [2019-12-28 05:27:29,440 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash 474051189, now seen corresponding path program 2 times [2019-12-28 05:27:29,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:29,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099234506] [2019-12-28 05:27:29,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 05:27:29,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 05:27:29,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099234506] [2019-12-28 05:27:29,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 05:27:29,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 05:27:29,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485388750] [2019-12-28 05:27:29,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 05:27:29,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 05:27:29,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 219 transitions. [2019-12-28 05:27:29,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 05:27:29,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 05:27:29,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 05:27:29,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 05:27:29,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 05:27:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-28 05:27:29,858 INFO L87 Difference]: Start difference. First operand 1653 states and 3543 transitions. Second operand 13 states. [2019-12-28 05:27:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 05:27:32,309 INFO L93 Difference]: Finished difference Result 6993 states and 15167 transitions. [2019-12-28 05:27:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-28 05:27:32,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2019-12-28 05:27:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 05:27:32,315 INFO L225 Difference]: With dead ends: 6993 [2019-12-28 05:27:32,315 INFO L226 Difference]: Without dead ends: 4328 [2019-12-28 05:27:32,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 05:27:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-12-28 05:27:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 1702. [2019-12-28 05:27:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-28 05:27:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3597 transitions. [2019-12-28 05:27:32,342 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3597 transitions. Word has length 83 [2019-12-28 05:27:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 05:27:32,342 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3597 transitions. [2019-12-28 05:27:32,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 05:27:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3597 transitions. [2019-12-28 05:27:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 05:27:32,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 05:27:32,344 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] [2019-12-28 05:27:32,344 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 05:27:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 05:27:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1193195599, now seen corresponding path program 3 times [2019-12-28 05:27:32,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 05:27:32,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771186637] [2019-12-28 05:27:32,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 05:27:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:27:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 05:27:32,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 05:27:32,420 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 05:27:32,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 05:27:32 BasicIcfg [2019-12-28 05:27:32,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 05:27:32,592 INFO L168 Benchmark]: Toolchain (without parser) took 46613.00 ms. Allocated memory was 135.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 98.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 950.6 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,598 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.57 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 97.8 MB in the beginning and 153.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 198.7 MB. Free memory was 153.5 MB in the beginning and 150.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,600 INFO L168 Benchmark]: Boogie Preprocessor took 35.27 ms. Allocated memory is still 198.7 MB. Free memory was 150.4 MB in the beginning and 149.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,600 INFO L168 Benchmark]: RCFGBuilder took 779.78 ms. Allocated memory is still 198.7 MB. Free memory was 148.3 MB in the beginning and 107.8 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,600 INFO L168 Benchmark]: TraceAbstraction took 44885.09 ms. Allocated memory was 198.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 107.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 896.7 MB. Max. memory is 7.1 GB. [2019-12-28 05:27:32,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.57 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 97.8 MB in the beginning and 153.5 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.93 ms. Allocated memory is still 198.7 MB. Free memory was 153.5 MB in the beginning and 150.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.27 ms. Allocated memory is still 198.7 MB. Free memory was 150.4 MB in the beginning and 149.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.78 ms. Allocated memory is still 198.7 MB. Free memory was 148.3 MB in the beginning and 107.8 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44885.09 ms. Allocated memory was 198.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 107.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 896.7 MB. 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] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2561; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2562; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 44.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6369 SDtfs, 10432 SDslu, 15028 SDs, 0 SdLazy, 7322 SolverSat, 660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 67101 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1532 ConstructedInterpolants, 0 QuantifiedInterpolants, 262840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...