/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 20:50:12,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 20:50:12,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 20:50:12,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 20:50:12,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 20:50:12,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 20:50:12,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 20:50:12,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 20:50:12,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 20:50:12,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 20:50:12,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 20:50:12,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 20:50:12,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 20:50:12,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 20:50:12,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 20:50:12,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 20:50:12,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 20:50:12,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 20:50:12,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 20:50:12,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 20:50:12,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 20:50:12,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 20:50:12,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 20:50:12,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 20:50:12,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 20:50:12,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 20:50:12,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 20:50:12,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 20:50:12,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 20:50:12,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 20:50:12,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 20:50:12,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 20:50:12,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 20:50:12,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 20:50:12,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 20:50:12,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 20:50:12,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 20:50:12,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 20:50:12,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 20:50:12,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 20:50:12,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 20:50:12,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 20:50:12,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 20:50:12,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 20:50:12,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 20:50:12,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 20:50:12,802 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 20:50:12,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 20:50:12,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 20:50:12,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 20:50:12,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 20:50:12,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 20:50:12,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 20:50:12,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 20:50:12,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 20:50:12,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 20:50:12,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 20:50:12,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 20:50:12,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 20:50:12,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 20:50:12,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 20:50:12,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 20:50:12,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 20:50:12,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 20:50:12,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 20:50:12,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 20:50:12,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 20:50:12,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 20:50:12,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 20:50:12,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 20:50:12,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 20:50:12,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 20:50:13,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 20:50:13,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 20:50:13,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 20:50:13,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 20:50:13,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 20:50:13,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2019-12-26 20:50:13,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995336c6/b845f3d31ad4491992f87ac68fdf105b/FLAGf267470cf [2019-12-26 20:50:13,805 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 20:50:13,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2019-12-26 20:50:13,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995336c6/b845f3d31ad4491992f87ac68fdf105b/FLAGf267470cf [2019-12-26 20:50:14,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d995336c6/b845f3d31ad4491992f87ac68fdf105b [2019-12-26 20:50:14,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 20:50:14,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 20:50:14,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 20:50:14,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 20:50:14,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 20:50:14,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:50:14" (1/1) ... [2019-12-26 20:50:14,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e5e7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:14, skipping insertion in model container [2019-12-26 20:50:14,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:50:14" (1/1) ... [2019-12-26 20:50:14,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 20:50:14,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 20:50:14,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:50:14,741 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 20:50:14,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:50:15,030 INFO L208 MainTranslator]: Completed translation [2019-12-26 20:50:15,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15 WrapperNode [2019-12-26 20:50:15,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 20:50:15,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 20:50:15,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 20:50:15,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 20:50:15,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 20:50:15,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 20:50:15,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 20:50:15,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 20:50:15,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... [2019-12-26 20:50:15,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 20:50:15,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 20:50:15,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 20:50:15,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 20:50:15,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 20:50:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-26 20:50:15,284 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-26 20:50:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-26 20:50:15,284 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-26 20:50:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 20:50:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 20:50:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-26 20:50:15,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 20:50:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-26 20:50:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-26 20:50:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 20:50:15,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 20:50:15,288 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 20:50:15,850 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 20:50:15,851 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-12-26 20:50:15,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:50:15 BoogieIcfgContainer [2019-12-26 20:50:15,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 20:50:15,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 20:50:15,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 20:50:15,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 20:50:15,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 08:50:14" (1/3) ... [2019-12-26 20:50:15,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4788993a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:50:15, skipping insertion in model container [2019-12-26 20:50:15,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:50:15" (2/3) ... [2019-12-26 20:50:15,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4788993a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:50:15, skipping insertion in model container [2019-12-26 20:50:15,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:50:15" (3/3) ... [2019-12-26 20:50:15,862 INFO L109 eAbstractionObserver]: Analyzing ICFG stack-1.i [2019-12-26 20:50:15,872 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 20:50:15,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 20:50:15,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 20:50:15,879 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 20:50:15,919 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,920 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,920 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,920 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,921 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,921 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,921 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,922 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,922 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,922 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,922 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,923 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,923 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,924 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,924 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,924 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,925 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,925 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,925 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,925 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,926 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,926 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,926 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,926 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,926 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,927 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,927 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,927 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,947 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,947 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,948 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,948 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,948 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,949 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,950 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,950 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,951 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,952 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,952 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,953 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,953 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,953 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,953 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,954 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,955 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,956 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,956 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,956 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,958 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,959 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,959 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,959 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,959 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,960 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,960 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,960 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,960 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,961 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,961 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,961 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,961 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,961 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,962 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,962 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,962 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,963 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,964 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,964 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,965 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,965 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,966 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,966 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,967 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,967 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,967 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,968 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,968 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,968 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,968 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,969 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,970 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,971 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,972 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,975 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,976 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,977 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,986 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,986 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,986 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,987 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,992 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,992 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,992 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,993 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,994 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,994 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,994 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,994 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,994 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:15,996 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,005 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,006 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:50:16,032 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 20:50:16,054 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:50:16,054 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:50:16,055 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:50:16,055 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:50:16,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:50:16,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:50:16,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:50:16,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:50:16,069 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 137 transitions [2019-12-26 20:50:16,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 137 transitions [2019-12-26 20:50:16,158 INFO L132 PetriNetUnfolder]: 10/137 cut-off events. [2019-12-26 20:50:16,159 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-26 20:50:16,175 INFO L76 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 137 events. 10/137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 101. Up to 3 conditions per place. [2019-12-26 20:50:16,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 137 transitions [2019-12-26 20:50:16,250 INFO L132 PetriNetUnfolder]: 10/137 cut-off events. [2019-12-26 20:50:16,250 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-26 20:50:16,254 INFO L76 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 137 events. 10/137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 101. Up to 3 conditions per place. [2019-12-26 20:50:16,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5224 [2019-12-26 20:50:16,267 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:50:19,435 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-12-26 20:50:19,539 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 20:50:20,169 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-12-26 20:50:20,398 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-12-26 20:50:20,411 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7527 [2019-12-26 20:50:20,411 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 20:50:20,415 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 40 transitions [2019-12-26 20:50:20,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2019-12-26 20:50:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-12-26 20:50:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-26 20:50:20,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:20,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-26 20:50:20,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:20,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash -729513012, now seen corresponding path program 1 times [2019-12-26 20:50:20,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:20,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56411359] [2019-12-26 20:50:20,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:20,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56411359] [2019-12-26 20:50:20,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:50:20,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:50:20,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586675234] [2019-12-26 20:50:20,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:50:20,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:20,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:50:20,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:20,831 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-12-26 20:50:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:20,945 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2019-12-26 20:50:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:50:20,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-26 20:50:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:20,968 INFO L225 Difference]: With dead ends: 504 [2019-12-26 20:50:20,968 INFO L226 Difference]: Without dead ends: 460 [2019-12-26 20:50:20,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-26 20:50:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2019-12-26 20:50:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-26 20:50:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2019-12-26 20:50:21,060 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2019-12-26 20:50:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:21,060 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2019-12-26 20:50:21,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:50:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2019-12-26 20:50:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:50:21,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:21,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:21,062 INFO L410 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash 268083260, now seen corresponding path program 1 times [2019-12-26 20:50:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805172701] [2019-12-26 20:50:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:21,135 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-26 20:50:21,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805172701] [2019-12-26 20:50:21,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:50:21,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:50:21,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149324375] [2019-12-26 20:50:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:50:21,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:21,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:50:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:21,138 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2019-12-26 20:50:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:21,153 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2019-12-26 20:50:21,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:50:21,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-26 20:50:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:21,158 INFO L225 Difference]: With dead ends: 464 [2019-12-26 20:50:21,158 INFO L226 Difference]: Without dead ends: 464 [2019-12-26 20:50:21,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-26 20:50:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-12-26 20:50:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-12-26 20:50:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2019-12-26 20:50:21,206 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2019-12-26 20:50:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:21,207 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2019-12-26 20:50:21,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:50:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2019-12-26 20:50:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:50:21,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:21,209 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:21,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2125897783, now seen corresponding path program 1 times [2019-12-26 20:50:21,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:21,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242267027] [2019-12-26 20:50:21,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:21,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242267027] [2019-12-26 20:50:21,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038631699] [2019-12-26 20:50:21,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:21,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-26 20:50:21,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:21,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:21,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-12-26 20:50:21,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945236588] [2019-12-26 20:50:21,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 20:50:21,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 20:50:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 20:50:21,496 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 7 states. [2019-12-26 20:50:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:21,632 INFO L93 Difference]: Finished difference Result 866 states and 2152 transitions. [2019-12-26 20:50:21,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 20:50:21,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-26 20:50:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:21,639 INFO L225 Difference]: With dead ends: 866 [2019-12-26 20:50:21,640 INFO L226 Difference]: Without dead ends: 851 [2019-12-26 20:50:21,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:50:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-26 20:50:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 575. [2019-12-26 20:50:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-26 20:50:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1484 transitions. [2019-12-26 20:50:21,668 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1484 transitions. Word has length 13 [2019-12-26 20:50:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:21,669 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1484 transitions. [2019-12-26 20:50:21,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 20:50:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1484 transitions. [2019-12-26 20:50:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 20:50:21,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:21,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:21,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:21,883 INFO L410 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash -221777397, now seen corresponding path program 1 times [2019-12-26 20:50:21,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:21,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877870909] [2019-12-26 20:50:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:21,978 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-26 20:50:21,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877870909] [2019-12-26 20:50:21,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:50:21,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:50:21,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951701493] [2019-12-26 20:50:21,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:50:21,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:50:21,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:21,980 INFO L87 Difference]: Start difference. First operand 575 states and 1484 transitions. Second operand 3 states. [2019-12-26 20:50:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:22,001 INFO L93 Difference]: Finished difference Result 304 states and 670 transitions. [2019-12-26 20:50:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:50:22,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 20:50:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:22,004 INFO L225 Difference]: With dead ends: 304 [2019-12-26 20:50:22,005 INFO L226 Difference]: Without dead ends: 304 [2019-12-26 20:50:22,005 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-26 20:50:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-26 20:50:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2019-12-26 20:50:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-26 20:50:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 643 transitions. [2019-12-26 20:50:22,014 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 643 transitions. Word has length 16 [2019-12-26 20:50:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:22,014 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 643 transitions. [2019-12-26 20:50:22,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:50:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 643 transitions. [2019-12-26 20:50:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 20:50:22,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:22,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:22,016 INFO L410 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2073289252, now seen corresponding path program 1 times [2019-12-26 20:50:22,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:22,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788803499] [2019-12-26 20:50:22,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:22,076 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-26 20:50:22,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788803499] [2019-12-26 20:50:22,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:50:22,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:50:22,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681321088] [2019-12-26 20:50:22,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:50:22,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:50:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:50:22,082 INFO L87 Difference]: Start difference. First operand 294 states and 643 transitions. Second operand 3 states. [2019-12-26 20:50:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:22,122 INFO L93 Difference]: Finished difference Result 372 states and 811 transitions. [2019-12-26 20:50:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:50:22,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 20:50:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:22,126 INFO L225 Difference]: With dead ends: 372 [2019-12-26 20:50:22,127 INFO L226 Difference]: Without dead ends: 372 [2019-12-26 20:50:22,127 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-26 20:50:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-26 20:50:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 295. [2019-12-26 20:50:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-12-26 20:50:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 647 transitions. [2019-12-26 20:50:22,136 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 647 transitions. Word has length 17 [2019-12-26 20:50:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:22,139 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 647 transitions. [2019-12-26 20:50:22,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:50:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 647 transitions. [2019-12-26 20:50:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 20:50:22,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:22,140 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-26 20:50:22,141 INFO L410 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1682621804, now seen corresponding path program 2 times [2019-12-26 20:50:22,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:22,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101209782] [2019-12-26 20:50:22,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:22,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101209782] [2019-12-26 20:50:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696436102] [2019-12-26 20:50:22,239 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:22,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:50:22,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:50:22,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-26 20:50:22,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:22,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:22,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-12-26 20:50:22,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18325811] [2019-12-26 20:50:22,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 20:50:22,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:22,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 20:50:22,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:50:22,345 INFO L87 Difference]: Start difference. First operand 295 states and 647 transitions. Second operand 9 states. [2019-12-26 20:50:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:22,452 INFO L93 Difference]: Finished difference Result 542 states and 1156 transitions. [2019-12-26 20:50:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 20:50:22,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-26 20:50:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:22,456 INFO L225 Difference]: With dead ends: 542 [2019-12-26 20:50:22,456 INFO L226 Difference]: Without dead ends: 542 [2019-12-26 20:50:22,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:50:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-26 20:50:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 372. [2019-12-26 20:50:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-26 20:50:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 816 transitions. [2019-12-26 20:50:22,468 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 816 transitions. Word has length 20 [2019-12-26 20:50:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:22,469 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 816 transitions. [2019-12-26 20:50:22,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 20:50:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 816 transitions. [2019-12-26 20:50:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 20:50:22,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:22,470 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] [2019-12-26 20:50:22,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:22,680 INFO L410 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:22,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1113859110, now seen corresponding path program 1 times [2019-12-26 20:50:22,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:22,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105100869] [2019-12-26 20:50:22,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:23,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105100869] [2019-12-26 20:50:23,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:50:23,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 20:50:23,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792333578] [2019-12-26 20:50:23,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 20:50:23,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 20:50:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-26 20:50:23,412 INFO L87 Difference]: Start difference. First operand 372 states and 816 transitions. Second operand 15 states. [2019-12-26 20:50:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:24,741 INFO L93 Difference]: Finished difference Result 703 states and 1483 transitions. [2019-12-26 20:50:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 20:50:24,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-26 20:50:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:24,746 INFO L225 Difference]: With dead ends: 703 [2019-12-26 20:50:24,746 INFO L226 Difference]: Without dead ends: 631 [2019-12-26 20:50:24,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2019-12-26 20:50:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-12-26 20:50:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 422. [2019-12-26 20:50:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-26 20:50:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 927 transitions. [2019-12-26 20:50:24,777 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 927 transitions. Word has length 21 [2019-12-26 20:50:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:24,777 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 927 transitions. [2019-12-26 20:50:24,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 20:50:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 927 transitions. [2019-12-26 20:50:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 20:50:24,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:24,779 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-12-26 20:50:24,779 INFO L410 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash -581875049, now seen corresponding path program 3 times [2019-12-26 20:50:24,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:24,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574467259] [2019-12-26 20:50:24,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:24,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574467259] [2019-12-26 20:50:24,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708281255] [2019-12-26 20:50:24,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:25,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-26 20:50:25,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:50:25,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-26 20:50:25,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:25,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:25,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-26 20:50:25,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302672950] [2019-12-26 20:50:25,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 20:50:25,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 20:50:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-26 20:50:25,086 INFO L87 Difference]: Start difference. First operand 422 states and 927 transitions. Second operand 11 states. [2019-12-26 20:50:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:25,214 INFO L93 Difference]: Finished difference Result 759 states and 1604 transitions. [2019-12-26 20:50:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 20:50:25,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-12-26 20:50:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:25,219 INFO L225 Difference]: With dead ends: 759 [2019-12-26 20:50:25,219 INFO L226 Difference]: Without dead ends: 759 [2019-12-26 20:50:25,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-12-26 20:50:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-26 20:50:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 499. [2019-12-26 20:50:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-26 20:50:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1096 transitions. [2019-12-26 20:50:25,234 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1096 transitions. Word has length 27 [2019-12-26 20:50:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:25,235 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 1096 transitions. [2019-12-26 20:50:25,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 20:50:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1096 transitions. [2019-12-26 20:50:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 20:50:25,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:25,236 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:25,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:25,440 INFO L410 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash 485601655, now seen corresponding path program 2 times [2019-12-26 20:50:25,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:25,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118177259] [2019-12-26 20:50:25,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:25,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118177259] [2019-12-26 20:50:25,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787898051] [2019-12-26 20:50:25,929 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:26,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-26 20:50:26,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:50:26,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-26 20:50:26,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:26,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:26,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-26 20:50:26,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:50:26,242 INFO L614 ElimStorePlain]: treesize reduction 5, result has 79.2 percent of original size [2019-12-26 20:50:26,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:26,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-12-26 20:50:26,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:26,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2019-12-26 20:50:26,797 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:26,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-12-26 20:50:26,804 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:26,822 INFO L614 ElimStorePlain]: treesize reduction 30, result has 34.8 percent of original size [2019-12-26 20:50:26,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:26,823 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:16 [2019-12-26 20:50:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-26 20:50:26,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-26 20:50:26,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 27 [2019-12-26 20:50:26,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079158071] [2019-12-26 20:50:26,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 20:50:26,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:26,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 20:50:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-12-26 20:50:26,903 INFO L87 Difference]: Start difference. First operand 499 states and 1096 transitions. Second operand 14 states. [2019-12-26 20:50:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:38,609 INFO L93 Difference]: Finished difference Result 850 states and 1830 transitions. [2019-12-26 20:50:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 20:50:38,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-12-26 20:50:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:38,614 INFO L225 Difference]: With dead ends: 850 [2019-12-26 20:50:38,615 INFO L226 Difference]: Without dead ends: 850 [2019-12-26 20:50:38,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=234, Invalid=1928, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 20:50:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-12-26 20:50:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 563. [2019-12-26 20:50:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-26 20:50:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1242 transitions. [2019-12-26 20:50:38,635 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1242 transitions. Word has length 28 [2019-12-26 20:50:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 1242 transitions. [2019-12-26 20:50:38,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 20:50:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1242 transitions. [2019-12-26 20:50:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 20:50:38,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:38,638 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:38,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:38,849 INFO L410 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:38,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1110098162, now seen corresponding path program 1 times [2019-12-26 20:50:38,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:38,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772578152] [2019-12-26 20:50:38,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:50:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772578152] [2019-12-26 20:50:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750931701] [2019-12-26 20:50:38,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:39,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-26 20:50:39,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:50:39,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:39,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-26 20:50:39,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241895458] [2019-12-26 20:50:39,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 20:50:39,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 20:50:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 20:50:39,106 INFO L87 Difference]: Start difference. First operand 563 states and 1242 transitions. Second operand 10 states. [2019-12-26 20:50:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:39,252 INFO L93 Difference]: Finished difference Result 912 states and 1935 transitions. [2019-12-26 20:50:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 20:50:39,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-26 20:50:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:39,257 INFO L225 Difference]: With dead ends: 912 [2019-12-26 20:50:39,257 INFO L226 Difference]: Without dead ends: 912 [2019-12-26 20:50:39,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-26 20:50:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-12-26 20:50:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 607. [2019-12-26 20:50:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-26 20:50:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1366 transitions. [2019-12-26 20:50:39,276 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1366 transitions. Word has length 31 [2019-12-26 20:50:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:39,276 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1366 transitions. [2019-12-26 20:50:39,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 20:50:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1366 transitions. [2019-12-26 20:50:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 20:50:39,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:39,279 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-12-26 20:50:39,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:39,484 INFO L410 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1062359284, now seen corresponding path program 4 times [2019-12-26 20:50:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:39,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759918380] [2019-12-26 20:50:39,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:39,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759918380] [2019-12-26 20:50:39,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306168694] [2019-12-26 20:50:39,623 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:39,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:50:39,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:50:39,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-26 20:50:39,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:39,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:39,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-12-26 20:50:39,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310734773] [2019-12-26 20:50:39,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 20:50:39,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 20:50:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-26 20:50:39,766 INFO L87 Difference]: Start difference. First operand 607 states and 1366 transitions. Second operand 13 states. [2019-12-26 20:50:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:50:39,945 INFO L93 Difference]: Finished difference Result 984 states and 2121 transitions. [2019-12-26 20:50:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 20:50:39,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-12-26 20:50:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:50:39,951 INFO L225 Difference]: With dead ends: 984 [2019-12-26 20:50:39,951 INFO L226 Difference]: Without dead ends: 984 [2019-12-26 20:50:39,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-12-26 20:50:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-12-26 20:50:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 684. [2019-12-26 20:50:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-12-26 20:50:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1535 transitions. [2019-12-26 20:50:39,969 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1535 transitions. Word has length 34 [2019-12-26 20:50:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:50:39,970 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1535 transitions. [2019-12-26 20:50:39,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 20:50:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1535 transitions. [2019-12-26 20:50:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 20:50:39,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:50:39,972 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:50:40,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:40,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:50:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:50:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1591752392, now seen corresponding path program 1 times [2019-12-26 20:50:40,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:50:40,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504365673] [2019-12-26 20:50:40,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:50:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:40,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504365673] [2019-12-26 20:50:40,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639779428] [2019-12-26 20:50:40,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:50:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:50:40,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-26 20:50:40,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:50:41,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:41,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-26 20:50:41,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:50:41,195 INFO L614 ElimStorePlain]: treesize reduction 5, result has 81.5 percent of original size [2019-12-26 20:50:41,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:41,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2019-12-26 20:50:41,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:50:41,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 64 [2019-12-26 20:50:41,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:50:41,592 INFO L614 ElimStorePlain]: treesize reduction 24, result has 70.0 percent of original size [2019-12-26 20:50:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:41,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-26 20:50:41,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:35 [2019-12-26 20:50:41,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:41,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:41,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:41,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:42,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:42,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:50:42,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:50:42,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-12-26 20:50:42,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:50:42,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:50:42,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2019-12-26 20:50:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:42,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:50:42,316 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:42,359 INFO L614 ElimStorePlain]: treesize reduction 48, result has 36.0 percent of original size [2019-12-26 20:50:42,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:50:42,360 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:11 [2019-12-26 20:50:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:50:42,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:50:42,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2019-12-26 20:50:42,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924558516] [2019-12-26 20:50:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-26 20:50:42,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:50:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-26 20:50:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 20:50:42,451 INFO L87 Difference]: Start difference. First operand 684 states and 1535 transitions. Second operand 40 states. [2019-12-26 20:50:44,325 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-26 20:50:47,670 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2019-12-26 20:50:52,281 WARN L192 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-12-26 20:50:54,618 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2019-12-26 20:50:56,785 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2019-12-26 20:50:57,393 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2019-12-26 20:50:59,080 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-12-26 20:50:59,792 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-26 20:51:02,166 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-12-26 20:51:10,002 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-26 20:51:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:11,891 INFO L93 Difference]: Finished difference Result 2239 states and 4767 transitions. [2019-12-26 20:51:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-12-26 20:51:11,892 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 36 [2019-12-26 20:51:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:11,902 INFO L225 Difference]: With dead ends: 2239 [2019-12-26 20:51:11,902 INFO L226 Difference]: Without dead ends: 1927 [2019-12-26 20:51:11,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1474, Invalid=10514, Unknown=2, NotChecked=0, Total=11990 [2019-12-26 20:51:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2019-12-26 20:51:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 856. [2019-12-26 20:51:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-12-26 20:51:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1917 transitions. [2019-12-26 20:51:11,933 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1917 transitions. Word has length 36 [2019-12-26 20:51:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:11,935 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1917 transitions. [2019-12-26 20:51:11,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-26 20:51:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1917 transitions. [2019-12-26 20:51:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 20:51:11,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:11,937 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:12,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:12,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:12,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -734267825, now seen corresponding path program 2 times [2019-12-26 20:51:12,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:12,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388447346] [2019-12-26 20:51:12,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:51:12,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388447346] [2019-12-26 20:51:12,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286110309] [2019-12-26 20:51:12,278 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:12,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:12,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:12,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-26 20:51:12,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:51:12,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:12,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-26 20:51:12,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711857441] [2019-12-26 20:51:12,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 20:51:12,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 20:51:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:51:12,426 INFO L87 Difference]: Start difference. First operand 856 states and 1917 transitions. Second operand 12 states. [2019-12-26 20:51:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:12,592 INFO L93 Difference]: Finished difference Result 1357 states and 2912 transitions. [2019-12-26 20:51:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 20:51:12,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-12-26 20:51:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:12,599 INFO L225 Difference]: With dead ends: 1357 [2019-12-26 20:51:12,599 INFO L226 Difference]: Without dead ends: 1357 [2019-12-26 20:51:12,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 20:51:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-26 20:51:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 856. [2019-12-26 20:51:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-12-26 20:51:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1917 transitions. [2019-12-26 20:51:12,623 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1917 transitions. Word has length 38 [2019-12-26 20:51:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:12,623 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1917 transitions. [2019-12-26 20:51:12,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 20:51:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1917 transitions. [2019-12-26 20:51:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 20:51:12,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:12,626 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-12-26 20:51:12,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:12,830 INFO L410 AbstractCegarLoop]: === Iteration 14 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 222448887, now seen corresponding path program 5 times [2019-12-26 20:51:12,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:12,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633105601] [2019-12-26 20:51:12,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:51:12,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633105601] [2019-12-26 20:51:12,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755743727] [2019-12-26 20:51:12,907 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:13,021 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-26 20:51:13,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:13,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-26 20:51:13,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:51:13,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-26 20:51:13,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2019-12-26 20:51:13,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081322715] [2019-12-26 20:51:13,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 20:51:13,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 20:51:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:51:13,041 INFO L87 Difference]: Start difference. First operand 856 states and 1917 transitions. Second operand 8 states. [2019-12-26 20:51:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:13,090 INFO L93 Difference]: Finished difference Result 2059 states and 4411 transitions. [2019-12-26 20:51:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 20:51:13,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-26 20:51:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:13,095 INFO L225 Difference]: With dead ends: 2059 [2019-12-26 20:51:13,096 INFO L226 Difference]: Without dead ends: 1037 [2019-12-26 20:51:13,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:51:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-26 20:51:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 845. [2019-12-26 20:51:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-26 20:51:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1712 transitions. [2019-12-26 20:51:13,116 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1712 transitions. Word has length 41 [2019-12-26 20:51:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:13,116 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1712 transitions. [2019-12-26 20:51:13,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 20:51:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1712 transitions. [2019-12-26 20:51:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 20:51:13,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:13,118 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:13,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:13,322 INFO L410 AbstractCegarLoop]: === Iteration 15 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2130367371, now seen corresponding path program 2 times [2019-12-26 20:51:13,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:13,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305111348] [2019-12-26 20:51:13,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:51:14,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305111348] [2019-12-26 20:51:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951239846] [2019-12-26 20:51:14,056 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:14,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-26 20:51:14,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:14,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-26 20:51:14,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:51:14,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-26 20:51:14,197 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:51:14,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:51:14,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:51:14,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2019-12-26 20:51:14,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:51:14,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-12-26 20:51:14,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:51:14,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:51:14,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-26 20:51:14,345 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:24 [2019-12-26 20:51:14,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:51:14,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:51:14,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:51:14,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-12-26 20:51:14,509 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:14,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-26 20:51:14,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:51:14,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2019-12-26 20:51:14,521 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:14,553 INFO L614 ElimStorePlain]: treesize reduction 31, result has 36.7 percent of original size [2019-12-26 20:51:14,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:14,554 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:12 [2019-12-26 20:51:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:51:14,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:14,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2019-12-26 20:51:14,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294853901] [2019-12-26 20:51:14,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-26 20:51:14,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-26 20:51:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-12-26 20:51:14,635 INFO L87 Difference]: Start difference. First operand 845 states and 1712 transitions. Second operand 26 states. [2019-12-26 20:51:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:17,932 INFO L93 Difference]: Finished difference Result 1351 states and 2750 transitions. [2019-12-26 20:51:17,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 20:51:17,932 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-12-26 20:51:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:17,939 INFO L225 Difference]: With dead ends: 1351 [2019-12-26 20:51:17,940 INFO L226 Difference]: Without dead ends: 1251 [2019-12-26 20:51:17,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=279, Invalid=2373, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 20:51:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-26 20:51:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1006. [2019-12-26 20:51:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-12-26 20:51:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2044 transitions. [2019-12-26 20:51:17,962 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2044 transitions. Word has length 43 [2019-12-26 20:51:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:17,962 INFO L462 AbstractCegarLoop]: Abstraction has 1006 states and 2044 transitions. [2019-12-26 20:51:17,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-26 20:51:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2044 transitions. [2019-12-26 20:51:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 20:51:17,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:17,964 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:18,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:18,168 INFO L410 AbstractCegarLoop]: === Iteration 16 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:18,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1478651474, now seen corresponding path program 3 times [2019-12-26 20:51:18,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:18,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967108164] [2019-12-26 20:51:18,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:51:18,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967108164] [2019-12-26 20:51:18,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221787239] [2019-12-26 20:51:18,286 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:18,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-26 20:51:18,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:18,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-26 20:51:18,379 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-26 20:51:18,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-26 20:51:18,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-12-26 20:51:18,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523545909] [2019-12-26 20:51:18,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 20:51:18,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 20:51:18,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-26 20:51:18,460 INFO L87 Difference]: Start difference. First operand 1006 states and 2044 transitions. Second operand 6 states. [2019-12-26 20:51:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:18,573 INFO L93 Difference]: Finished difference Result 1290 states and 2598 transitions. [2019-12-26 20:51:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 20:51:18,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-26 20:51:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:18,579 INFO L225 Difference]: With dead ends: 1290 [2019-12-26 20:51:18,580 INFO L226 Difference]: Without dead ends: 1280 [2019-12-26 20:51:18,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-26 20:51:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-26 20:51:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 992. [2019-12-26 20:51:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-12-26 20:51:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2009 transitions. [2019-12-26 20:51:18,603 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2009 transitions. Word has length 45 [2019-12-26 20:51:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:18,603 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 2009 transitions. [2019-12-26 20:51:18,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 20:51:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2009 transitions. [2019-12-26 20:51:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 20:51:18,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:18,606 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:18,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:18,810 INFO L410 AbstractCegarLoop]: === Iteration 17 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 917951124, now seen corresponding path program 4 times [2019-12-26 20:51:18,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:18,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210862382] [2019-12-26 20:51:18,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-26 20:51:18,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210862382] [2019-12-26 20:51:18,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29878598] [2019-12-26 20:51:18,948 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:19,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:51:19,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:19,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-26 20:51:19,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-26 20:51:19,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:19,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-12-26 20:51:19,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29144886] [2019-12-26 20:51:19,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 20:51:19,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 20:51:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 20:51:19,081 INFO L87 Difference]: Start difference. First operand 992 states and 2009 transitions. Second operand 12 states. [2019-12-26 20:51:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:51:19,213 INFO L93 Difference]: Finished difference Result 1158 states and 2297 transitions. [2019-12-26 20:51:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 20:51:19,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-12-26 20:51:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:51:19,218 INFO L225 Difference]: With dead ends: 1158 [2019-12-26 20:51:19,218 INFO L226 Difference]: Without dead ends: 1043 [2019-12-26 20:51:19,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-26 20:51:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-26 20:51:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 869. [2019-12-26 20:51:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-26 20:51:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1737 transitions. [2019-12-26 20:51:19,237 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1737 transitions. Word has length 45 [2019-12-26 20:51:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:51:19,237 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1737 transitions. [2019-12-26 20:51:19,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 20:51:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1737 transitions. [2019-12-26 20:51:19,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 20:51:19,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:51:19,239 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:51:19,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:19,444 INFO L410 AbstractCegarLoop]: === Iteration 18 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:51:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:51:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1165878632, now seen corresponding path program 3 times [2019-12-26 20:51:19,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:51:19,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310882614] [2019-12-26 20:51:19,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:51:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:51:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:51:20,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310882614] [2019-12-26 20:51:20,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365586738] [2019-12-26 20:51:20,477 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:51:20,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-26 20:51:20,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:51:20,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-26 20:51:20,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:51:20,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:51:20,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-26 20:51:20,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:51:20,834 INFO L614 ElimStorePlain]: treesize reduction 5, result has 79.2 percent of original size [2019-12-26 20:51:20,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:20,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-12-26 20:51:21,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:51:21,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-12-26 20:51:21,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:51:21,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:51:21,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:21,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:20 [2019-12-26 20:51:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:51:21,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-12-26 20:51:21,847 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:21,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2019-12-26 20:51:21,851 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:21,868 INFO L614 ElimStorePlain]: treesize reduction 30, result has 34.8 percent of original size [2019-12-26 20:51:21,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:51:21,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:16 [2019-12-26 20:51:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-26 20:51:21,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:51:21,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 40 [2019-12-26 20:51:21,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958830285] [2019-12-26 20:51:21,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-26 20:51:21,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:51:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-26 20:51:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1531, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 20:51:21,953 INFO L87 Difference]: Start difference. First operand 869 states and 1737 transitions. Second operand 41 states. [2019-12-26 20:51:29,675 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-26 20:51:33,514 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-12-26 20:51:38,172 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-26 20:51:43,746 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-26 20:51:44,600 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-12-26 20:51:51,784 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-12-26 20:51:53,605 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-26 20:51:53,814 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-12-26 20:51:54,224 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-26 20:51:54,504 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-26 20:51:56,007 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-26 20:51:59,628 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-26 20:52:03,079 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-12-26 20:52:09,356 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:52:11,848 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-26 20:52:13,490 WARN L192 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-26 20:52:15,892 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-12-26 20:52:16,968 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-26 20:52:17,291 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-26 20:52:20,082 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-12-26 20:52:23,142 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-26 20:52:23,804 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-12-26 20:52:26,329 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-26 20:52:29,469 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-26 20:52:29,933 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-26 20:52:30,272 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-26 20:52:30,857 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:52:33,113 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-12-26 20:52:34,573 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-26 20:52:35,017 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-12-26 20:52:35,681 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-26 20:52:39,870 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-26 20:52:42,100 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-26 20:52:43,426 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-26 20:52:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:52:44,831 INFO L93 Difference]: Finished difference Result 1814 states and 3630 transitions. [2019-12-26 20:52:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-26 20:52:44,832 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2019-12-26 20:52:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:52:44,838 INFO L225 Difference]: With dead ends: 1814 [2019-12-26 20:52:44,838 INFO L226 Difference]: Without dead ends: 1814 [2019-12-26 20:52:44,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5394 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=1768, Invalid=16592, Unknown=0, NotChecked=0, Total=18360 [2019-12-26 20:52:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2019-12-26 20:52:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 876. [2019-12-26 20:52:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-12-26 20:52:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1771 transitions. [2019-12-26 20:52:44,864 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1771 transitions. Word has length 50 [2019-12-26 20:52:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:52:44,865 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1771 transitions. [2019-12-26 20:52:44,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-26 20:52:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1771 transitions. [2019-12-26 20:52:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 20:52:44,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:52:44,867 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:52:45,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:45,074 INFO L410 AbstractCegarLoop]: === Iteration 19 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:52:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:52:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1409287388, now seen corresponding path program 4 times [2019-12-26 20:52:45,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:52:45,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927741642] [2019-12-26 20:52:45,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:52:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:52:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:52:45,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927741642] [2019-12-26 20:52:45,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916581546] [2019-12-26 20:52:45,965 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:52:46,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-26 20:52:46,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-26 20:52:46,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-26 20:52:46,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:52:46,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:52:46,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-26 20:52:46,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:52:46,301 INFO L614 ElimStorePlain]: treesize reduction 5, result has 79.2 percent of original size [2019-12-26 20:52:46,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:46,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2019-12-26 20:52:46,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:52:46,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-12-26 20:52:46,603 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:52:46,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:52:46,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:46,617 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:20 [2019-12-26 20:52:46,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-26 20:52:46,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-12-26 20:52:46,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-26 20:52:46,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-26 20:52:46,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:46,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:20 [2019-12-26 20:52:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-26 20:52:48,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2019-12-26 20:52:48,600 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:48,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2019-12-26 20:52:48,604 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:48,622 INFO L614 ElimStorePlain]: treesize reduction 30, result has 34.8 percent of original size [2019-12-26 20:52:48,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-26 20:52:48,622 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:16 [2019-12-26 20:52:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:52:48,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:52:48,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2019-12-26 20:52:48,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170200068] [2019-12-26 20:52:48,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-26 20:52:48,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:52:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-26 20:52:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2298, Unknown=0, NotChecked=0, Total=2450 [2019-12-26 20:52:48,721 INFO L87 Difference]: Start difference. First operand 876 states and 1771 transitions. Second operand 50 states. [2019-12-26 20:52:53,978 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-12-26 20:52:56,485 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-26 20:52:56,767 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-12-26 20:52:57,468 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-12-26 20:53:00,731 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-26 20:53:02,504 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-26 20:53:03,092 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-12-26 20:53:04,370 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-26 20:53:05,331 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-12-26 20:53:10,751 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-12-26 20:53:12,944 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-26 20:53:17,990 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-26 20:53:18,488 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-26 20:53:24,422 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-12-26 20:53:26,516 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-12-26 20:53:27,687 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-12-26 20:53:30,770 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-12-26 20:53:34,368 WARN L192 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-12-26 20:53:35,383 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-26 20:53:41,876 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-26 20:53:43,244 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-26 20:53:44,299 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-26 20:53:45,958 WARN L192 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-12-26 20:53:46,299 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-12-26 20:53:48,389 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-26 20:53:50,949 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-26 20:53:52,691 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-26 20:53:54,703 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-12-26 20:53:55,374 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-26 20:53:56,863 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-26 20:53:57,274 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-12-26 20:53:59,601 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:54:00,350 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-12-26 20:54:03,077 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-26 20:54:07,588 WARN L192 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-12-26 20:54:07,909 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-26 20:54:08,412 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-26 20:54:08,837 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-26 20:54:09,544 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-26 20:54:10,265 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-26 20:54:11,805 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-12-26 20:54:14,419 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-26 20:54:14,784 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-26 20:54:15,561 WARN L192 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-12-26 20:54:16,537 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-26 20:54:17,651 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-26 20:54:17,995 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-12-26 20:54:18,460 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-26 20:54:20,970 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-26 20:54:21,764 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-26 20:54:22,456 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-12-26 20:54:23,142 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-26 20:54:23,670 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:54:26,257 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:54:26,525 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-26 20:54:26,963 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-26 20:54:27,978 WARN L192 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-26 20:54:28,821 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-26 20:54:29,265 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-12-26 20:54:31,433 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-12-26 20:54:32,081 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-26 20:54:35,342 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-12-26 20:54:36,311 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 72 [2019-12-26 20:54:36,548 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-12-26 20:54:37,679 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-26 20:54:41,673 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-26 20:54:41,970 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 Received shutdown request... [2019-12-26 20:54:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-26 20:54:43,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:54:43,098 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 20:54:43,102 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 20:54:43,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 08:54:43 BasicIcfg [2019-12-26 20:54:43,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 20:54:43,104 INFO L168 Benchmark]: Toolchain (without parser) took 269045.72 ms. Allocated memory was 137.4 MB in the beginning and 323.5 MB in the end (delta: 186.1 MB). Free memory was 99.3 MB in the beginning and 94.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 191.2 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,104 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 972.45 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 98.9 MB in the beginning and 132.7 MB in the end (delta: -33.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.67 ms. Allocated memory is still 202.9 MB. Free memory was 132.7 MB in the beginning and 130.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,105 INFO L168 Benchmark]: Boogie Preprocessor took 63.07 ms. Allocated memory is still 202.9 MB. Free memory was 130.0 MB in the beginning and 127.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,106 INFO L168 Benchmark]: RCFGBuilder took 642.74 ms. Allocated memory is still 202.9 MB. Free memory was 127.9 MB in the beginning and 96.3 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,107 INFO L168 Benchmark]: TraceAbstraction took 267248.65 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 95.6 MB in the beginning and 94.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 121.9 MB. Max. memory is 7.1 GB. [2019-12-26 20:54:43,108 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 972.45 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 98.9 MB in the beginning and 132.7 MB in the end (delta: -33.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 113.67 ms. Allocated memory is still 202.9 MB. Free memory was 132.7 MB in the beginning and 130.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.07 ms. Allocated memory is still 202.9 MB. Free memory was 130.0 MB in the beginning and 127.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.74 ms. Allocated memory is still 202.9 MB. Free memory was 127.9 MB in the beginning and 96.3 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267248.65 ms. Allocated memory was 202.9 MB in the beginning and 323.5 MB in the end (delta: 120.6 MB). Free memory was 95.6 MB in the beginning and 94.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 121.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 133 ProgramPointsBefore, 39 ProgramPointsAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 5224 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 4 ChoiceCompositions, 2885 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 7527 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 919]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 919). Cancelled while BasicCegarLoop was constructing difference of abstraction (876states) and FLOYD_HOARE automaton (currently 109 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 156 known predicates. - TimeoutResultAtElement [Line: 919]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 919). Cancelled while BasicCegarLoop was constructing difference of abstraction (876states) and FLOYD_HOARE automaton (currently 109 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 156 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 127 locations, 2 error locations. Result: TIMEOUT, OverallTime: 267.0s, OverallIterations: 19, TraceHistogramMax: 6, AutomataDifference: 244.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1264 SDtfs, 5164 SDslu, 11425 SDs, 0 SdLazy, 14469 SolverSat, 983 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 103.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1157 GetRequests, 504 SyntacticMatches, 13 SemanticMatches, 639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17819 ImplicationChecksByTransitivity, 146.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 5343 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1074 NumberOfCodeBlocks, 1037 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1041 ConstructedInterpolants, 110 QuantifiedInterpolants, 397255 SizeOfPredicates, 181 NumberOfNonLiveVariables, 3339 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 320/964 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 could not prove your program: Timeout Completed graceful shutdown