/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:10:40,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:10:40,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:10:40,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:10:40,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:10:40,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:10:40,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:10:40,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:10:40,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:10:40,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:10:40,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:10:40,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:10:40,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:10:40,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:10:40,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:10:40,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:10:40,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:10:40,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:10:40,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:10:40,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:10:40,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:10:40,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:10:40,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:10:40,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:10:40,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:10:40,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:10:40,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:10:40,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:10:40,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:10:40,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:10:40,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:10:40,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:10:40,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:10:40,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:10:40,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:10:40,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:10:40,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:10:40,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:10:40,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:10:40,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:10:40,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:10:40,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:10:40,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:10:40,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:10:40,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:10:40,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:10:40,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:10:40,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:10:40,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:10:40,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:10:40,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:10:40,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:10:40,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:10:40,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:10:40,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:10:40,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:10:40,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:10:40,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:10:40,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:10:40,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:10:40,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:10:40,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:10:40,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:10:40,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:10:40,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:10:40,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:10:40,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:10:40,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:10:40,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:10:40,311 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:10:40,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:10:40,311 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:10:40,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:10:40,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:10:40,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:10:40,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:10:40,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:10:40,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:10:40,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2019-12-27 15:10:40,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de5ae879/8618becc15d94eadaa3a5c9c8f533411/FLAG44ef86ed6 [2019-12-27 15:10:41,255 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:10:41,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2019-12-27 15:10:41,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de5ae879/8618becc15d94eadaa3a5c9c8f533411/FLAG44ef86ed6 [2019-12-27 15:10:41,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1de5ae879/8618becc15d94eadaa3a5c9c8f533411 [2019-12-27 15:10:41,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:10:41,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:10:41,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:10:41,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:10:41,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:10:41,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:10:41" (1/1) ... [2019-12-27 15:10:41,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be3ea45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:41, skipping insertion in model container [2019-12-27 15:10:41,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:10:41" (1/1) ... [2019-12-27 15:10:41,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:10:41,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:10:42,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:10:42,139 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:10:42,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:10:42,393 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:10:42,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42 WrapperNode [2019-12-27 15:10:42,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:10:42,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:10:42,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:10:42,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:10:42,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:10:42,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:10:42,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:10:42,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:10:42,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (1/1) ... [2019-12-27 15:10:42,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:10:42,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:10:42,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:10:42,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:10:42,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (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-27 15:10:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 15:10:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 15:10:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 15:10:42,679 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 15:10:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:10:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:10:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 15:10:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:10:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-27 15:10:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 15:10:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:10:42,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:10:42,683 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:10:43,704 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:10:43,704 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-27 15:10:43,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:10:43 BoogieIcfgContainer [2019-12-27 15:10:43,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:10:43,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:10:43,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:10:43,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:10:43,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:10:41" (1/3) ... [2019-12-27 15:10:43,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eecc188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:10:43, skipping insertion in model container [2019-12-27 15:10:43,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:10:42" (2/3) ... [2019-12-27 15:10:43,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eecc188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:10:43, skipping insertion in model container [2019-12-27 15:10:43,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:10:43" (3/3) ... [2019-12-27 15:10:43,714 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2019-12-27 15:10:43,724 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:10:43,724 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:10:43,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:10:43,731 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,769 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,769 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,770 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,770 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,771 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,771 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,772 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,774 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,777 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,777 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,777 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,778 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,778 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,778 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,779 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,779 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,780 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,780 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,781 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,781 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,782 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,782 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,782 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,783 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,785 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,785 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,786 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,786 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,788 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,788 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,789 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,789 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,789 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,789 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,790 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,790 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,790 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,790 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,791 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,791 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,791 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,791 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,791 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,792 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,793 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,793 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,793 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,793 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,793 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,794 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,794 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,794 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,794 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,794 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,795 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,795 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,795 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,795 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,795 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,796 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,797 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,797 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,797 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,797 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,797 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,798 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,798 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,798 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,798 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,798 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,799 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,800 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,801 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,801 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,801 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,801 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,801 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,802 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,803 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,804 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,804 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,804 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,804 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,804 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,805 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,805 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,805 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,805 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,805 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,806 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,806 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,806 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,806 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,806 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,807 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,808 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,809 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,809 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,809 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,809 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,809 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,810 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,811 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,811 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,811 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,811 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,815 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,815 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,815 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,816 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,817 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,817 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,817 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,817 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,817 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,818 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,818 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,818 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,818 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,818 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,819 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,819 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,819 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,819 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,825 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,825 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,825 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,825 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,826 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,826 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,826 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,826 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,826 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,827 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,828 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,828 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,828 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,828 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,828 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,829 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,830 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,830 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,830 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,830 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,830 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:10:43,853 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:10:43,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:10:43,874 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:10:43,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:10:43,874 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:10:43,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:10:43,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:10:43,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:10:43,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:10:43,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions [2019-12-27 15:10:43,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-27 15:10:44,008 INFO L132 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-27 15:10:44,008 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 15:10:44,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-27 15:10:44,043 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-27 15:10:44,135 INFO L132 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-27 15:10:44,135 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 15:10:44,140 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-27 15:10:44,151 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2019-12-27 15:10:44,152 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:10:47,620 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 15:10:48,489 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-27 15:10:48,640 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-27 15:10:49,634 WARN L192 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-12-27 15:10:49,890 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-12-27 15:10:50,872 WARN L192 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2019-12-27 15:10:51,307 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-12-27 15:10:51,328 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17748 [2019-12-27 15:10:51,328 INFO L214 etLargeBlockEncoding]: Total number of compositions: 178 [2019-12-27 15:10:51,331 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-27 15:10:51,370 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2019-12-27 15:10:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2019-12-27 15:10:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 15:10:51,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:51,380 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 15:10:51,380 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 1 times [2019-12-27 15:10:51,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:51,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954728081] [2019-12-27 15:10:51,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:51,512 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-27 15:10:51,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954728081] [2019-12-27 15:10:51,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:10:51,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 15:10:51,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994171590] [2019-12-27 15:10:51,515 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:51,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:51,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 15:10:51,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:51,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:10:51,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 15:10:51,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 15:10:51,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:10:51,549 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2019-12-27 15:10:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:51,594 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2019-12-27 15:10:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 15:10:51,596 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 15:10:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:51,618 INFO L225 Difference]: With dead ends: 715 [2019-12-27 15:10:51,618 INFO L226 Difference]: Without dead ends: 524 [2019-12-27 15:10:51,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:10:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-27 15:10:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-27 15:10:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-27 15:10:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2019-12-27 15:10:51,728 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2019-12-27 15:10:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:51,728 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2019-12-27 15:10:51,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 15:10:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2019-12-27 15:10:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:10:51,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:51,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:51,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:51,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 1 times [2019-12-27 15:10:51,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:51,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667393432] [2019-12-27 15:10:51,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:51,909 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-27 15:10:51,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667393432] [2019-12-27 15:10:51,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:10:51,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:10:51,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551433761] [2019-12-27 15:10:51,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:51,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:51,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 15:10:51,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:51,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:10:51,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:10:51,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:10:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:10:51,921 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2019-12-27 15:10:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:51,939 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2019-12-27 15:10:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:10:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 15:10:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:51,941 INFO L225 Difference]: With dead ends: 236 [2019-12-27 15:10:51,941 INFO L226 Difference]: Without dead ends: 212 [2019-12-27 15:10:51,942 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-27 15:10:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-27 15:10:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-12-27 15:10:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-27 15:10:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2019-12-27 15:10:51,952 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2019-12-27 15:10:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:51,953 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2019-12-27 15:10:51,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:10:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2019-12-27 15:10:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:10:51,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:51,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:51,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:51,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 1 times [2019-12-27 15:10:51,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:51,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299463493] [2019-12-27 15:10:51,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:52,054 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-27 15:10:52,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299463493] [2019-12-27 15:10:52,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:10:52,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:10:52,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911765282] [2019-12-27 15:10:52,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:52,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:52,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 41 transitions. [2019-12-27 15:10:52,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:52,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:10:52,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:10:52,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:10:52,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:10:52,074 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2019-12-27 15:10:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:52,102 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2019-12-27 15:10:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:10:52,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 15:10:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:52,105 INFO L225 Difference]: With dead ends: 272 [2019-12-27 15:10:52,105 INFO L226 Difference]: Without dead ends: 272 [2019-12-27 15:10:52,106 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-27 15:10:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-27 15:10:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2019-12-27 15:10:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-27 15:10:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2019-12-27 15:10:52,116 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2019-12-27 15:10:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:52,116 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2019-12-27 15:10:52,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:10:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-12-27 15:10:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 15:10:52,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:52,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:52,119 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1197878433, now seen corresponding path program 1 times [2019-12-27 15:10:52,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:52,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915143493] [2019-12-27 15:10:52,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:52,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915143493] [2019-12-27 15:10:52,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:10:52,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:10:52,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517576585] [2019-12-27 15:10:52,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:52,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:52,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 50 transitions. [2019-12-27 15:10:52,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:52,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:10:52,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:10:52,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:10:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:10:52,232 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2019-12-27 15:10:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:52,249 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2019-12-27 15:10:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:10:52,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 15:10:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:52,252 INFO L225 Difference]: With dead ends: 166 [2019-12-27 15:10:52,253 INFO L226 Difference]: Without dead ends: 164 [2019-12-27 15:10:52,253 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-27 15:10:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-27 15:10:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-27 15:10:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-27 15:10:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2019-12-27 15:10:52,283 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2019-12-27 15:10:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2019-12-27 15:10:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:10:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2019-12-27 15:10:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:10:52,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:52,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:52,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 1 times [2019-12-27 15:10:52,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:52,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850151963] [2019-12-27 15:10:52,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:52,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850151963] [2019-12-27 15:10:52,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777868703] [2019-12-27 15:10:52,389 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-27 15:10:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:52,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-27 15:10:52,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:52,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:52,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 15:10:52,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37000646] [2019-12-27 15:10:52,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:52,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:52,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 41 transitions. [2019-12-27 15:10:52,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:52,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:10:52,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:10:52,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:10:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:10:52,536 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 4 states. [2019-12-27 15:10:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:52,563 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2019-12-27 15:10:52,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:10:52,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 15:10:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:52,565 INFO L225 Difference]: With dead ends: 240 [2019-12-27 15:10:52,566 INFO L226 Difference]: Without dead ends: 240 [2019-12-27 15:10:52,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:10:52,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-27 15:10:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2019-12-27 15:10:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-27 15:10:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 405 transitions. [2019-12-27 15:10:52,573 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 405 transitions. Word has length 27 [2019-12-27 15:10:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:52,574 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 405 transitions. [2019-12-27 15:10:52,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:10:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 405 transitions. [2019-12-27 15:10:52,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:10:52,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:52,575 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, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:52,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:52,788 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:52,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1561383711, now seen corresponding path program 2 times [2019-12-27 15:10:52,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:52,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913969988] [2019-12-27 15:10:52,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913969988] [2019-12-27 15:10:52,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290909180] [2019-12-27 15:10:52,900 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-27 15:10:53,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:10:53,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:53,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-27 15:10:53,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:53,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:53,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-27 15:10:53,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936695515] [2019-12-27 15:10:53,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:53,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:53,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:10:53,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:53,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:10:53,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:10:53,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:10:53,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:10:53,087 INFO L87 Difference]: Start difference. First operand 204 states and 405 transitions. Second operand 5 states. [2019-12-27 15:10:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:53,131 INFO L93 Difference]: Finished difference Result 280 states and 546 transitions. [2019-12-27 15:10:53,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:10:53,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 15:10:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:53,133 INFO L225 Difference]: With dead ends: 280 [2019-12-27 15:10:53,133 INFO L226 Difference]: Without dead ends: 280 [2019-12-27 15:10:53,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:10:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-27 15:10:53,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2019-12-27 15:10:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-27 15:10:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2019-12-27 15:10:53,142 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 34 [2019-12-27 15:10:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:53,142 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2019-12-27 15:10:53,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:10:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2019-12-27 15:10:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:10:53,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:53,144 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:53,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:53,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash -303137003, now seen corresponding path program 3 times [2019-12-27 15:10:53,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:53,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604076074] [2019-12-27 15:10:53,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:53,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604076074] [2019-12-27 15:10:53,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452401583] [2019-12-27 15:10:53,451 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-27 15:10:53,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 15:10:53,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:53,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-27 15:10:53,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:53,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:53,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-27 15:10:53,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [245542874] [2019-12-27 15:10:53,976 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:53,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:54,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 83 transitions. [2019-12-27 15:10:54,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:54,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:10:54,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:10:54,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:10:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:10:54,063 INFO L87 Difference]: Start difference. First operand 244 states and 479 transitions. Second operand 6 states. [2019-12-27 15:10:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:54,111 INFO L93 Difference]: Finished difference Result 320 states and 620 transitions. [2019-12-27 15:10:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:10:54,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 15:10:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:54,113 INFO L225 Difference]: With dead ends: 320 [2019-12-27 15:10:54,113 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 15:10:54,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:10:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 15:10:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2019-12-27 15:10:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-27 15:10:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 553 transitions. [2019-12-27 15:10:54,122 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 553 transitions. Word has length 41 [2019-12-27 15:10:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:54,122 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 553 transitions. [2019-12-27 15:10:54,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:10:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2019-12-27 15:10:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 15:10:54,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:54,124 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:54,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:54,337 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1439404639, now seen corresponding path program 4 times [2019-12-27 15:10:54,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:54,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385692787] [2019-12-27 15:10:54,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:54,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385692787] [2019-12-27 15:10:54,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189755643] [2019-12-27 15:10:54,426 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 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-27 15:10:54,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:10:54,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:54,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 15:10:54,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:54,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:54,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 15:10:54,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [263387117] [2019-12-27 15:10:54,570 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:54,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:54,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 104 transitions. [2019-12-27 15:10:54,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:54,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:10:54,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:10:54,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:10:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:10:54,661 INFO L87 Difference]: Start difference. First operand 284 states and 553 transitions. Second operand 7 states. [2019-12-27 15:10:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:54,726 INFO L93 Difference]: Finished difference Result 360 states and 694 transitions. [2019-12-27 15:10:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:10:54,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 15:10:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:54,730 INFO L225 Difference]: With dead ends: 360 [2019-12-27 15:10:54,730 INFO L226 Difference]: Without dead ends: 360 [2019-12-27 15:10:54,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:10:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-27 15:10:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2019-12-27 15:10:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-27 15:10:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 627 transitions. [2019-12-27 15:10:54,742 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 627 transitions. Word has length 48 [2019-12-27 15:10:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:54,743 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 627 transitions. [2019-12-27 15:10:54,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:10:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 627 transitions. [2019-12-27 15:10:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 15:10:54,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:54,745 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:54,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:54,958 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2001070123, now seen corresponding path program 5 times [2019-12-27 15:10:54,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:54,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910436873] [2019-12-27 15:10:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:55,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910436873] [2019-12-27 15:10:55,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536747823] [2019-12-27 15:10:55,129 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 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-27 15:10:55,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 15:10:55,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:55,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 15:10:55,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:55,347 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 13 treesize of output 9 [2019-12-27 15:10:55,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 15:10:55,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,405 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 25 treesize of output 62 [2019-12-27 15:10:55,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,442 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-27 15:10:55,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:10:55,450 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:10:55,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-27 15:10:55,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:10:55,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:10:55,552 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:10:55,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:10:55,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,599 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 25 treesize of output 54 [2019-12-27 15:10:55,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:10:55,600 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,693 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 15:10:55,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:10:55,695 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 15:10:55,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:10:55,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:10:55,787 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 25 treesize of output 24 [2019-12-27 15:10:55,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,796 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 15 treesize of output 11 [2019-12-27 15:10:55,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,831 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:10:55,831 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 15:10:55,900 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-27 15:10:55,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 15:10:55,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:10:55,958 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 25 treesize of output 24 [2019-12-27 15:10:55,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:55,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:55,976 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-27 15:10:55,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 15:10:56,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:56,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-27 15:10:56,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:56,093 INFO L614 ElimStorePlain]: treesize reduction 69, result has 28.1 percent of original size [2019-12-27 15:10:56,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:56,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-27 15:10:56,123 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-27 15:10:56,123 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 25 treesize of output 24 [2019-12-27 15:10:56,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:56,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:56,130 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-27 15:10:56,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-27 15:10:56,135 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 19 treesize of output 7 [2019-12-27 15:10:56,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:56,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:56,137 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-27 15:10:56,137 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-27 15:10:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 15:10:56,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:56,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-12-27 15:10:56,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1647239133] [2019-12-27 15:10:56,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:56,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:56,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 125 transitions. [2019-12-27 15:10:56,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:56,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:10:56,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:10:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:10:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:10:56,298 INFO L87 Difference]: Start difference. First operand 324 states and 627 transitions. Second operand 8 states. [2019-12-27 15:10:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:56,364 INFO L93 Difference]: Finished difference Result 400 states and 768 transitions. [2019-12-27 15:10:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 15:10:56,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 15:10:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:56,368 INFO L225 Difference]: With dead ends: 400 [2019-12-27 15:10:56,368 INFO L226 Difference]: Without dead ends: 400 [2019-12-27 15:10:56,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:10:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-27 15:10:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 364. [2019-12-27 15:10:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-27 15:10:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 701 transitions. [2019-12-27 15:10:56,380 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 701 transitions. Word has length 55 [2019-12-27 15:10:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:56,380 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 701 transitions. [2019-12-27 15:10:56,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:10:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 701 transitions. [2019-12-27 15:10:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 15:10:56,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:56,382 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:56,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:56,595 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:56,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1406754401, now seen corresponding path program 6 times [2019-12-27 15:10:56,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:56,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917681517] [2019-12-27 15:10:56,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:56,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917681517] [2019-12-27 15:10:56,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687996439] [2019-12-27 15:10:56,727 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-27 15:10:57,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 15:10:57,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:57,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 15:10:57,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:57,110 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 13 treesize of output 9 [2019-12-27 15:10:57,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:57,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-27 15:10:57,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:10:57,155 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 25 treesize of output 24 [2019-12-27 15:10:57,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:57,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:13 [2019-12-27 15:10:57,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:10:57,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:57,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 91 [2019-12-27 15:10:57,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,263 INFO L614 ElimStorePlain]: treesize reduction 61, result has 30.7 percent of original size [2019-12-27 15:10:57,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2019-12-27 15:10:57,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:10:57,289 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 25 treesize of output 24 [2019-12-27 15:10:57,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:10:57,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:10:57,298 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-27 15:10:57,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-27 15:10:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 52 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-27 15:10:57,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:57,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-12-27 15:10:57,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459839276] [2019-12-27 15:10:57,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:57,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:57,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 146 transitions. [2019-12-27 15:10:57,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:57,785 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:10:57,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:10:57,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:57,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:10:57,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:10:57,786 INFO L87 Difference]: Start difference. First operand 364 states and 701 transitions. Second operand 9 states. [2019-12-27 15:10:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:57,860 INFO L93 Difference]: Finished difference Result 440 states and 842 transitions. [2019-12-27 15:10:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:10:57,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-27 15:10:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:57,863 INFO L225 Difference]: With dead ends: 440 [2019-12-27 15:10:57,864 INFO L226 Difference]: Without dead ends: 440 [2019-12-27 15:10:57,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:10:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-27 15:10:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 404. [2019-12-27 15:10:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-12-27 15:10:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 775 transitions. [2019-12-27 15:10:57,874 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 775 transitions. Word has length 62 [2019-12-27 15:10:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:57,875 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 775 transitions. [2019-12-27 15:10:57,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:10:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 775 transitions. [2019-12-27 15:10:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 15:10:57,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:57,876 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:58,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:58,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1880399723, now seen corresponding path program 7 times [2019-12-27 15:10:58,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:58,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051680181] [2019-12-27 15:10:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051680181] [2019-12-27 15:10:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811851138] [2019-12-27 15:10:58,209 INFO L92 rtionOrderModulation]: Changing assertion order to 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-27 15:10:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:58,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 15:10:58,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:58,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:58,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 15:10:58,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438524228] [2019-12-27 15:10:58,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:58,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:58,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 167 transitions. [2019-12-27 15:10:58,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:58,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:10:58,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:10:58,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:10:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:10:58,611 INFO L87 Difference]: Start difference. First operand 404 states and 775 transitions. Second operand 10 states. [2019-12-27 15:10:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:58,691 INFO L93 Difference]: Finished difference Result 480 states and 916 transitions. [2019-12-27 15:10:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:10:58,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-27 15:10:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:58,695 INFO L225 Difference]: With dead ends: 480 [2019-12-27 15:10:58,695 INFO L226 Difference]: Without dead ends: 480 [2019-12-27 15:10:58,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-27 15:10:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-12-27 15:10:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 444. [2019-12-27 15:10:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 15:10:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 849 transitions. [2019-12-27 15:10:58,706 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 849 transitions. Word has length 69 [2019-12-27 15:10:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:58,707 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 849 transitions. [2019-12-27 15:10:58,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:10:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 849 transitions. [2019-12-27 15:10:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 15:10:58,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:58,708 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:58,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:58,938 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:58,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1722416929, now seen corresponding path program 8 times [2019-12-27 15:10:58,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:58,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186235404] [2019-12-27 15:10:58,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:10:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:10:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:59,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186235404] [2019-12-27 15:10:59,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625031800] [2019-12-27 15:10:59,082 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-27 15:10:59,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:10:59,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:10:59,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 15:10:59,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:10:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:10:59,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:10:59,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 15:10:59,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781923718] [2019-12-27 15:10:59,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:10:59,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:10:59,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 188 transitions. [2019-12-27 15:10:59,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:10:59,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 15:10:59,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 15:10:59,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:10:59,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 15:10:59,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:10:59,667 INFO L87 Difference]: Start difference. First operand 444 states and 849 transitions. Second operand 11 states. [2019-12-27 15:10:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:10:59,763 INFO L93 Difference]: Finished difference Result 520 states and 990 transitions. [2019-12-27 15:10:59,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:10:59,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-12-27 15:10:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:10:59,768 INFO L225 Difference]: With dead ends: 520 [2019-12-27 15:10:59,769 INFO L226 Difference]: Without dead ends: 520 [2019-12-27 15:10:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:10:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-12-27 15:10:59,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 484. [2019-12-27 15:10:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-27 15:10:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 923 transitions. [2019-12-27 15:10:59,786 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 923 transitions. Word has length 76 [2019-12-27 15:10:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:10:59,787 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 923 transitions. [2019-12-27 15:10:59,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 15:10:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 923 transitions. [2019-12-27 15:10:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 15:10:59,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:10:59,790 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:10:59,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:10:59,993 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:10:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:10:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash -942778027, now seen corresponding path program 9 times [2019-12-27 15:10:59,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:10:59,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549349274] [2019-12-27 15:10:59,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:00,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549349274] [2019-12-27 15:11:00,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512716637] [2019-12-27 15:11:00,151 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 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-27 15:11:00,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 15:11:00,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:00,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2019-12-27 15:11:00,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:00,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:00,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 228 treesize of output 218 [2019-12-27 15:11:00,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:00,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,792 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-12-27 15:11:00,793 INFO L614 ElimStorePlain]: treesize reduction 757, result has 3.4 percent of original size [2019-12-27 15:11:00,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,794 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:11 [2019-12-27 15:11:00,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 15:11:00,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:00,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-27 15:11:00,878 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 25 treesize of output 24 [2019-12-27 15:11:00,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:00,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:00,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:20 [2019-12-27 15:11:00,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:00,976 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:00,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:00,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:01,042 INFO L614 ElimStorePlain]: treesize reduction 30, result has 58.9 percent of original size [2019-12-27 15:11:01,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:01,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:29 [2019-12-27 15:11:01,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:01,263 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 25 treesize of output 24 [2019-12-27 15:11:01,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:01,281 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:01,282 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-27 15:11:01,282 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2019-12-27 15:11:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-27 15:11:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 15:11:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-12-27 15:11:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1232095432] [2019-12-27 15:11:01,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:01,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:01,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 209 transitions. [2019-12-27 15:11:01,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:01,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:11:01,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:11:01,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:11:01,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:11:01,874 INFO L87 Difference]: Start difference. First operand 484 states and 923 transitions. Second operand 7 states. [2019-12-27 15:11:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:02,143 INFO L93 Difference]: Finished difference Result 780 states and 1465 transitions. [2019-12-27 15:11:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:11:02,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 15:11:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:02,149 INFO L225 Difference]: With dead ends: 780 [2019-12-27 15:11:02,150 INFO L226 Difference]: Without dead ends: 780 [2019-12-27 15:11:02,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-27 15:11:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-12-27 15:11:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 648. [2019-12-27 15:11:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-12-27 15:11:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1214 transitions. [2019-12-27 15:11:02,171 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1214 transitions. Word has length 83 [2019-12-27 15:11:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:02,171 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1214 transitions. [2019-12-27 15:11:02,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:11:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1214 transitions. [2019-12-27 15:11:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 15:11:02,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:02,177 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:02,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:02,391 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -118973483, now seen corresponding path program 1 times [2019-12-27 15:11:02,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:02,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326638859] [2019-12-27 15:11:02,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:02,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326638859] [2019-12-27 15:11:02,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100933845] [2019-12-27 15:11:02,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-27 15:11:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:02,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 15:11:02,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:02,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:02,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 15:11:02,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276313028] [2019-12-27 15:11:02,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:02,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:03,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 221 transitions. [2019-12-27 15:11:03,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:03,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 15:11:03,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:11:03,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:03,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:11:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:11:03,278 INFO L87 Difference]: Start difference. First operand 648 states and 1214 transitions. Second operand 12 states. [2019-12-27 15:11:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:03,358 INFO L93 Difference]: Finished difference Result 760 states and 1418 transitions. [2019-12-27 15:11:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 15:11:03,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-12-27 15:11:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:03,364 INFO L225 Difference]: With dead ends: 760 [2019-12-27 15:11:03,364 INFO L226 Difference]: Without dead ends: 760 [2019-12-27 15:11:03,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:11:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-27 15:11:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 708. [2019-12-27 15:11:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-12-27 15:11:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1323 transitions. [2019-12-27 15:11:03,380 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1323 transitions. Word has length 87 [2019-12-27 15:11:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:03,381 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1323 transitions. [2019-12-27 15:11:03,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:11:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1323 transitions. [2019-12-27 15:11:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 15:11:03,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:03,383 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:03,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:03,593 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:03,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1791613077, now seen corresponding path program 2 times [2019-12-27 15:11:03,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:03,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222145854] [2019-12-27 15:11:03,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:03,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222145854] [2019-12-27 15:11:03,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624702854] [2019-12-27 15:11:03,763 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 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-27 15:11:03,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:11:03,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:03,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 15:11:03,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:03,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:03,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 15:11:03,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33170050] [2019-12-27 15:11:03,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:04,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:04,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 245 transitions. [2019-12-27 15:11:04,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:04,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:11:04,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 15:11:04,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 15:11:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:11:04,947 INFO L87 Difference]: Start difference. First operand 708 states and 1323 transitions. Second operand 13 states. [2019-12-27 15:11:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:05,039 INFO L93 Difference]: Finished difference Result 820 states and 1527 transitions. [2019-12-27 15:11:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:11:05,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-27 15:11:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:05,046 INFO L225 Difference]: With dead ends: 820 [2019-12-27 15:11:05,047 INFO L226 Difference]: Without dead ends: 820 [2019-12-27 15:11:05,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-12-27 15:11:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-27 15:11:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 768. [2019-12-27 15:11:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 15:11:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1432 transitions. [2019-12-27 15:11:05,064 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1432 transitions. Word has length 95 [2019-12-27 15:11:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:05,064 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1432 transitions. [2019-12-27 15:11:05,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 15:11:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1432 transitions. [2019-12-27 15:11:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 15:11:05,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:05,067 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:05,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:05,271 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash -171931425, now seen corresponding path program 3 times [2019-12-27 15:11:05,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:05,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982433373] [2019-12-27 15:11:05,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:05,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982433373] [2019-12-27 15:11:05,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576040246] [2019-12-27 15:11:05,455 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 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-27 15:11:06,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 15:11:06,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:06,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-27 15:11:06,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:06,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 223 [2019-12-27 15:11:06,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,477 INFO L614 ElimStorePlain]: treesize reduction 184, result has 8.5 percent of original size [2019-12-27 15:11:06,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2019-12-27 15:11:06,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 15:11:06,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-27 15:11:06,546 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 25 treesize of output 24 [2019-12-27 15:11:06,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-12-27 15:11:06,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:06,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:06,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,633 INFO L614 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2019-12-27 15:11:06,633 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,633 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-12-27 15:11:06,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:06,664 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 25 treesize of output 24 [2019-12-27 15:11:06,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,675 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-27 15:11:06,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2019-12-27 15:11:06,708 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 31 treesize of output 15 [2019-12-27 15:11:06,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2019-12-27 15:11:06,735 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 25 treesize of output 24 [2019-12-27 15:11:06,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2019-12-27 15:11:06,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:06,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-27 15:11:06,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,836 INFO L614 ElimStorePlain]: treesize reduction 26, result has 49.0 percent of original size [2019-12-27 15:11:06,837 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-27 15:11:06,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-12-27 15:11:06,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:06,876 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 25 treesize of output 24 [2019-12-27 15:11:06,877 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,892 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-27 15:11:06,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-27 15:11:06,899 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 19 treesize of output 7 [2019-12-27 15:11:06,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,901 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:06,901 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:06,901 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:1 [2019-12-27 15:11:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 118 proven. 50 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-12-27 15:11:06,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:06,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2019-12-27 15:11:06,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033131468] [2019-12-27 15:11:06,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:06,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:07,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 266 transitions. [2019-12-27 15:11:07,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:08,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:11:08,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 15:11:08,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 15:11:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:11:08,003 INFO L87 Difference]: Start difference. First operand 768 states and 1432 transitions. Second operand 14 states. [2019-12-27 15:11:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:08,108 INFO L93 Difference]: Finished difference Result 880 states and 1636 transitions. [2019-12-27 15:11:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 15:11:08,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2019-12-27 15:11:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:08,112 INFO L225 Difference]: With dead ends: 880 [2019-12-27 15:11:08,112 INFO L226 Difference]: Without dead ends: 880 [2019-12-27 15:11:08,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:11:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-27 15:11:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 828. [2019-12-27 15:11:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 15:11:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1541 transitions. [2019-12-27 15:11:08,130 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1541 transitions. Word has length 102 [2019-12-27 15:11:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:08,131 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1541 transitions. [2019-12-27 15:11:08,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 15:11:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1541 transitions. [2019-12-27 15:11:08,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-27 15:11:08,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:08,133 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:08,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:08,338 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -971957345, now seen corresponding path program 4 times [2019-12-27 15:11:08,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:08,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859396903] [2019-12-27 15:11:08,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:08,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859396903] [2019-12-27 15:11:08,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437721616] [2019-12-27 15:11:08,570 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 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-27 15:11:19,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:11:19,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:19,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 15:11:19,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:19,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:19,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 15:11:19,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63570168] [2019-12-27 15:11:19,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:20,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:21,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 290 transitions. [2019-12-27 15:11:21,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:21,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 15:11:21,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:11:21,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:11:21,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:11:21,379 INFO L87 Difference]: Start difference. First operand 828 states and 1541 transitions. Second operand 15 states. [2019-12-27 15:11:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:21,479 INFO L93 Difference]: Finished difference Result 940 states and 1745 transitions. [2019-12-27 15:11:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 15:11:21,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2019-12-27 15:11:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:21,486 INFO L225 Difference]: With dead ends: 940 [2019-12-27 15:11:21,487 INFO L226 Difference]: Without dead ends: 940 [2019-12-27 15:11:21,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:11:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-12-27 15:11:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 888. [2019-12-27 15:11:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-12-27 15:11:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1650 transitions. [2019-12-27 15:11:21,504 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1650 transitions. Word has length 110 [2019-12-27 15:11:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:21,504 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1650 transitions. [2019-12-27 15:11:21,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:11:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1650 transitions. [2019-12-27 15:11:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-27 15:11:21,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:21,507 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:21,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:21,708 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1440504171, now seen corresponding path program 5 times [2019-12-27 15:11:21,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:21,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487616735] [2019-12-27 15:11:21,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487616735] [2019-12-27 15:11:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298504883] [2019-12-27 15:11:21,967 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 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-27 15:11:22,356 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-27 15:11:22,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:22,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-27 15:11:22,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:22,392 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 13 treesize of output 9 [2019-12-27 15:11:22,392 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:22,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 15:11:22,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:22,426 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 25 treesize of output 62 [2019-12-27 15:11:22,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,479 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-27 15:11:22,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:22,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:22,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-27 15:11:22,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:22,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:22,617 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 25 treesize of output 54 [2019-12-27 15:11:22,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:22,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:22,646 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:22,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:22,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,783 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 15:11:22,784 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 15:11:22,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:22,785 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 15:11:22,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:22,856 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 15 treesize of output 11 [2019-12-27 15:11:22,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:22,869 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 25 treesize of output 24 [2019-12-27 15:11:22,870 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:22,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:22,901 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 15:11:22,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:22,976 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-27 15:11:22,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:22,984 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 0 case distinctions, treesize of input 25 treesize of output 15 [2019-12-27 15:11:22,984 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:23,004 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:35 [2019-12-27 15:11:23,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,067 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 25 treesize of output 62 [2019-12-27 15:11:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,074 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 15 treesize of output 11 [2019-12-27 15:11:23,074 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,144 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-27 15:11:23,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 15:11:23,146 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-27 15:11:23,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,238 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 25 treesize of output 54 [2019-12-27 15:11:23,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:23,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:23,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,284 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,390 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-12-27 15:11:23,391 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-27 15:11:23,392 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:23,392 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-27 15:11:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:23,454 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 15 treesize of output 11 [2019-12-27 15:11:23,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:23,463 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 25 treesize of output 24 [2019-12-27 15:11:23,463 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:23,504 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 15:11:23,594 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-27 15:11:23,595 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 15:11:23,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:23,646 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 25 treesize of output 24 [2019-12-27 15:11:23,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-27 15:11:23,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:23,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:23,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,826 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-27 15:11:23,827 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,827 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 15:11:23,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:23,871 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 25 treesize of output 24 [2019-12-27 15:11:23,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,890 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-27 15:11:23,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 15:11:23,938 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 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 15:11:23,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:23,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-27 15:11:23,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:23,989 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 25 treesize of output 24 [2019-12-27 15:11:23,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:23,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:24,000 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-27 15:11:24,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 15:11:24,097 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:24,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:24,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-27 15:11:24,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:24,241 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-12-27 15:11:24,242 INFO L614 ElimStorePlain]: treesize reduction 69, result has 28.1 percent of original size [2019-12-27 15:11:24,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:24,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-27 15:11:24,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:24,272 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 25 treesize of output 24 [2019-12-27 15:11:24,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:24,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:24,282 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-27 15:11:24,282 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-27 15:11:24,286 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 19 treesize of output 7 [2019-12-27 15:11:24,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:24,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:24,288 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-27 15:11:24,289 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-27 15:11:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 358 proven. 23 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-27 15:11:24,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:24,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2019-12-27 15:11:24,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804685379] [2019-12-27 15:11:24,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:24,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:25,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 311 transitions. [2019-12-27 15:11:25,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:25,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 15:11:25,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:11:25,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:11:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:11:25,835 INFO L87 Difference]: Start difference. First operand 888 states and 1650 transitions. Second operand 16 states. [2019-12-27 15:11:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:25,970 INFO L93 Difference]: Finished difference Result 1000 states and 1854 transitions. [2019-12-27 15:11:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 15:11:25,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2019-12-27 15:11:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:25,975 INFO L225 Difference]: With dead ends: 1000 [2019-12-27 15:11:25,975 INFO L226 Difference]: Without dead ends: 1000 [2019-12-27 15:11:25,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 15:11:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-12-27 15:11:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 948. [2019-12-27 15:11:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-27 15:11:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1759 transitions. [2019-12-27 15:11:25,995 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1759 transitions. Word has length 117 [2019-12-27 15:11:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:25,995 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 1759 transitions. [2019-12-27 15:11:25,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:11:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1759 transitions. [2019-12-27 15:11:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-27 15:11:25,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:25,999 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:26,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:26,203 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:26,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1867635883, now seen corresponding path program 6 times [2019-12-27 15:11:26,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:26,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948581118] [2019-12-27 15:11:26,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:26,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948581118] [2019-12-27 15:11:26,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244310112] [2019-12-27 15:11:26,442 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:43,534 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 15:11:43,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:43,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-27 15:11:43,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:43,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 45 [2019-12-27 15:11:43,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 15:11:43,585 INFO L614 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2019-12-27 15:11:43,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2019-12-27 15:11:43,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 15:11:43,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,648 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 15:11:43,670 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 25 treesize of output 24 [2019-12-27 15:11:43,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 15:11:43,721 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:43,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:43,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,769 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 15:11:43,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 15:11:43,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:43,809 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 25 treesize of output 24 [2019-12-27 15:11:43,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,819 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,820 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-27 15:11:43,820 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 15:11:43,860 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 31 treesize of output 15 [2019-12-27 15:11:43,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-27 15:11:43,895 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 25 treesize of output 24 [2019-12-27 15:11:43,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:43,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-27 15:11:43,957 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:43,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:43,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:43,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:44,000 INFO L614 ElimStorePlain]: treesize reduction 30, result has 52.4 percent of original size [2019-12-27 15:11:44,001 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:44,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-12-27 15:11:44,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:44,048 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 25 treesize of output 24 [2019-12-27 15:11:44,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:44,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:44,060 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-27 15:11:44,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-27 15:11:44,064 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 19 treesize of output 7 [2019-12-27 15:11:44,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:44,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:44,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:44,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:1 [2019-12-27 15:11:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 308 proven. 20 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-12-27 15:11:44,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:44,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2019-12-27 15:11:44,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1660951862] [2019-12-27 15:11:44,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:44,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:46,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 335 transitions. [2019-12-27 15:11:46,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:46,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 15:11:46,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 15:11:46,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:46,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 15:11:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:11:46,185 INFO L87 Difference]: Start difference. First operand 948 states and 1759 transitions. Second operand 17 states. [2019-12-27 15:11:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:46,303 INFO L93 Difference]: Finished difference Result 1060 states and 1963 transitions. [2019-12-27 15:11:46,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 15:11:46,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2019-12-27 15:11:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:46,308 INFO L225 Difference]: With dead ends: 1060 [2019-12-27 15:11:46,308 INFO L226 Difference]: Without dead ends: 1060 [2019-12-27 15:11:46,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-12-27 15:11:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-27 15:11:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1008. [2019-12-27 15:11:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-12-27 15:11:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1868 transitions. [2019-12-27 15:11:46,328 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1868 transitions. Word has length 125 [2019-12-27 15:11:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:46,328 INFO L462 AbstractCegarLoop]: Abstraction has 1008 states and 1868 transitions. [2019-12-27 15:11:46,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 15:11:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1868 transitions. [2019-12-27 15:11:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-27 15:11:46,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:46,331 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:46,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:46,548 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 657892895, now seen corresponding path program 7 times [2019-12-27 15:11:46,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:46,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293555641] [2019-12-27 15:11:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 659 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:46,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293555641] [2019-12-27 15:11:46,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821858103] [2019-12-27 15:11:46,828 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:47,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 15:11:47,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 659 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:47,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:47,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 15:11:47,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173819498] [2019-12-27 15:11:47,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:47,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:49,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 356 transitions. [2019-12-27 15:11:49,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:49,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:11:49,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 15:11:49,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 15:11:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:11:49,969 INFO L87 Difference]: Start difference. First operand 1008 states and 1868 transitions. Second operand 18 states. [2019-12-27 15:11:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:50,088 INFO L93 Difference]: Finished difference Result 1120 states and 2072 transitions. [2019-12-27 15:11:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 15:11:50,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 132 [2019-12-27 15:11:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:50,097 INFO L225 Difference]: With dead ends: 1120 [2019-12-27 15:11:50,098 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 15:11:50,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:11:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 15:11:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1068. [2019-12-27 15:11:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-27 15:11:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1977 transitions. [2019-12-27 15:11:50,116 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1977 transitions. Word has length 132 [2019-12-27 15:11:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:50,116 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1977 transitions. [2019-12-27 15:11:50,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 15:11:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1977 transitions. [2019-12-27 15:11:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-27 15:11:50,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:50,120 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:50,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:50,324 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:50,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash -214566689, now seen corresponding path program 8 times [2019-12-27 15:11:50,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:50,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767436188] [2019-12-27 15:11:50,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:50,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767436188] [2019-12-27 15:11:50,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733445166] [2019-12-27 15:11:50,587 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:50,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:11:50,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:50,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 15:11:50,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:50,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:50,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 15:11:50,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [601612434] [2019-12-27 15:11:50,830 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:50,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:11:54,056 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 380 transitions. [2019-12-27 15:11:54,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:11:54,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:11:54,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 15:11:54,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:11:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 15:11:54,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:11:54,062 INFO L87 Difference]: Start difference. First operand 1068 states and 1977 transitions. Second operand 19 states. [2019-12-27 15:11:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:11:54,190 INFO L93 Difference]: Finished difference Result 1180 states and 2181 transitions. [2019-12-27 15:11:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:11:54,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2019-12-27 15:11:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:11:54,194 INFO L225 Difference]: With dead ends: 1180 [2019-12-27 15:11:54,194 INFO L226 Difference]: Without dead ends: 1180 [2019-12-27 15:11:54,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:11:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-12-27 15:11:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1128. [2019-12-27 15:11:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-12-27 15:11:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2086 transitions. [2019-12-27 15:11:54,211 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2086 transitions. Word has length 140 [2019-12-27 15:11:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:11:54,211 INFO L462 AbstractCegarLoop]: Abstraction has 1128 states and 2086 transitions. [2019-12-27 15:11:54,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 15:11:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2086 transitions. [2019-12-27 15:11:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-27 15:11:54,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:11:54,215 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:11:54,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:54,419 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:11:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:11:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2004393643, now seen corresponding path program 9 times [2019-12-27 15:11:54,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:11:54,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641998431] [2019-12-27 15:11:54,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:11:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:11:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:11:54,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641998431] [2019-12-27 15:11:54,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174240245] [2019-12-27 15:11:54,709 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:11:55,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 15:11:55,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:11:55,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-27 15:11:55,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:11:56,025 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 13 treesize of output 9 [2019-12-27 15:11:56,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-27 15:11:56,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,074 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 25 treesize of output 62 [2019-12-27 15:11:56,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,116 INFO L614 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-12-27 15:11:56,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:41 [2019-12-27 15:11:56,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,239 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 25 treesize of output 54 [2019-12-27 15:11:56,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:56,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:11:56,290 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,436 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-27 15:11:56,437 INFO L614 ElimStorePlain]: treesize reduction 49, result has 68.0 percent of original size [2019-12-27 15:11:56,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:56,438 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:60 [2019-12-27 15:11:56,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:56,528 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 25 treesize of output 24 [2019-12-27 15:11:56,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,535 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 15 treesize of output 11 [2019-12-27 15:11:56,535 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:56,579 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:60 [2019-12-27 15:11:56,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,674 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 0 case distinctions, treesize of input 25 treesize of output 15 [2019-12-27 15:11:56,675 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,682 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-27 15:11:56,682 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,715 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:11:56,715 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:48 [2019-12-27 15:11:56,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,775 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 15 treesize of output 11 [2019-12-27 15:11:56,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:56,809 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 25 treesize of output 62 [2019-12-27 15:11:56,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,810 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:56,898 INFO L614 ElimStorePlain]: treesize reduction 24, result has 79.1 percent of original size [2019-12-27 15:11:56,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,900 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 2 xjuncts. [2019-12-27 15:11:56,900 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:85, output treesize:53 [2019-12-27 15:11:56,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:56,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:11:57,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:57,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-27 15:11:57,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:57,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:57,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:11:57,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 15:11:57,047 INFO L614 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-12-27 15:11:57,048 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-27 15:11:57,048 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-27 15:11:57,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:11:57,079 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 25 treesize of output 24 [2019-12-27 15:11:57,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:57,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:57,092 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-27 15:11:57,092 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-27 15:11:57,096 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 19 treesize of output 7 [2019-12-27 15:11:57,097 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:11:57,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:11:57,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:11:57,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:1 [2019-12-27 15:11:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 199 proven. 80 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-12-27 15:11:57,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:11:57,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 31 [2019-12-27 15:11:57,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734534548] [2019-12-27 15:11:57,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:11:57,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:12:00,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 275 states and 401 transitions. [2019-12-27 15:12:00,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:12:00,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 15:12:00,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 15:12:00,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:12:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 15:12:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:12:00,182 INFO L87 Difference]: Start difference. First operand 1128 states and 2086 transitions. Second operand 20 states. [2019-12-27 15:12:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:12:00,349 INFO L93 Difference]: Finished difference Result 1240 states and 2290 transitions. [2019-12-27 15:12:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 15:12:00,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 147 [2019-12-27 15:12:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:12:00,356 INFO L225 Difference]: With dead ends: 1240 [2019-12-27 15:12:00,356 INFO L226 Difference]: Without dead ends: 1240 [2019-12-27 15:12:00,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2019-12-27 15:12:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-12-27 15:12:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1188. [2019-12-27 15:12:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-12-27 15:12:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 2195 transitions. [2019-12-27 15:12:00,377 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 2195 transitions. Word has length 147 [2019-12-27 15:12:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:12:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 1188 states and 2195 transitions. [2019-12-27 15:12:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 15:12:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 2195 transitions. [2019-12-27 15:12:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-27 15:12:00,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:12:00,381 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:12:00,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:12:00,588 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:12:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:12:00,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1208688149, now seen corresponding path program 10 times [2019-12-27 15:12:00,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:12:00,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480674481] [2019-12-27 15:12:00,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:12:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:12:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 0 proven. 963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:12:00,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480674481] [2019-12-27 15:12:00,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419976898] [2019-12-27 15:12:00,990 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:01,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 15:13:01,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:01,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 15:13:01,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 0 proven. 963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:01,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:01,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 15:13:01,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068173063] [2019-12-27 15:13:01,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:01,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:05,982 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 291 states and 425 transitions. [2019-12-27 15:13:05,982 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:05,986 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 15:13:05,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 15:13:05,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 15:13:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:13:05,987 INFO L87 Difference]: Start difference. First operand 1188 states and 2195 transitions. Second operand 21 states. [2019-12-27 15:13:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:06,143 INFO L93 Difference]: Finished difference Result 1300 states and 2399 transitions. [2019-12-27 15:13:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:13:06,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 155 [2019-12-27 15:13:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:06,148 INFO L225 Difference]: With dead ends: 1300 [2019-12-27 15:13:06,148 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 15:13:06,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-12-27 15:13:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 15:13:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1248. [2019-12-27 15:13:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-12-27 15:13:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2304 transitions. [2019-12-27 15:13:06,165 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 2304 transitions. Word has length 155 [2019-12-27 15:13:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:06,165 INFO L462 AbstractCegarLoop]: Abstraction has 1248 states and 2304 transitions. [2019-12-27 15:13:06,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 15:13:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2304 transitions. [2019-12-27 15:13:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 15:13:06,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:06,170 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:06,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:06,384 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2131628895, now seen corresponding path program 11 times [2019-12-27 15:13:06,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:06,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603787746] [2019-12-27 15:13:06,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 1072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:06,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603787746] [2019-12-27 15:13:06,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936357078] [2019-12-27 15:13:06,730 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:06,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 15:13:06,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:06,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-27 15:13:06,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:07,001 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 13 treesize of output 9 [2019-12-27 15:13:07,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-27 15:13:07,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,043 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 25 treesize of output 62 [2019-12-27 15:13:07,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,080 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-27 15:13:07,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:07,081 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-27 15:13:07,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:07,160 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:07,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:13:07,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,198 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 25 treesize of output 54 [2019-12-27 15:13:07,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,199 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,315 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 15:13:07,316 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-27 15:13:07,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:07,317 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-27 15:13:07,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:07,393 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 25 treesize of output 24 [2019-12-27 15:13:07,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,399 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 15 treesize of output 11 [2019-12-27 15:13:07,399 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,431 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:07,431 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 15:13:07,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,536 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 0 case distinctions, treesize of input 21 treesize of output 11 [2019-12-27 15:13:07,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,558 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 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 15:13:07,558 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:07,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:35 [2019-12-27 15:13:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,614 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 15 treesize of output 11 [2019-12-27 15:13:07,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,645 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 25 treesize of output 62 [2019-12-27 15:13:07,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,718 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-27 15:13:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-27 15:13:07,720 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-27 15:13:07,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,823 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 25 treesize of output 54 [2019-12-27 15:13:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:07,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:07,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:07,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:13:07,849 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:07,946 INFO L614 ElimStorePlain]: treesize reduction 50, result has 64.8 percent of original size [2019-12-27 15:13:07,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:07,947 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-27 15:13:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:08,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:08,013 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 25 treesize of output 24 [2019-12-27 15:13:08,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,018 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 15 treesize of output 11 [2019-12-27 15:13:08,019 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,052 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:08,053 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-27 15:13:08,185 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-27 15:13:08,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,196 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-27 15:13:08,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:08,269 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 25 treesize of output 24 [2019-12-27 15:13:08,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-27 15:13:08,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:08,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:13:08,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,465 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-27 15:13:08,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-27 15:13:08,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:08,527 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 25 treesize of output 24 [2019-12-27 15:13:08,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,546 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-27 15:13:08,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-27 15:13:08,630 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-27 15:13:08,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,643 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,644 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-27 15:13:08,644 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-27 15:13:08,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:08,706 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 25 treesize of output 24 [2019-12-27 15:13:08,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,720 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-27 15:13:08,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-27 15:13:08,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:08,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-27 15:13:08,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:08,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:08,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,873 INFO L614 ElimStorePlain]: treesize reduction 110, result has 23.1 percent of original size [2019-12-27 15:13:08,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:13 [2019-12-27 15:13:08,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:08,908 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 25 treesize of output 24 [2019-12-27 15:13:08,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,917 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-27 15:13:08,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-12-27 15:13:08,921 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 19 treesize of output 7 [2019-12-27 15:13:08,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:08,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:08,929 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-27 15:13:08,929 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2019-12-27 15:13:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 611 proven. 25 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-12-27 15:13:08,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:08,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2019-12-27 15:13:08,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709006716] [2019-12-27 15:13:08,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:09,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:13,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 446 transitions. [2019-12-27 15:13:13,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:13,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 15:13:13,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 15:13:13,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:13,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 15:13:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1299, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:13:13,157 INFO L87 Difference]: Start difference. First operand 1248 states and 2304 transitions. Second operand 22 states. [2019-12-27 15:13:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:13,344 INFO L93 Difference]: Finished difference Result 1360 states and 2508 transitions. [2019-12-27 15:13:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 15:13:13,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 162 [2019-12-27 15:13:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:13,350 INFO L225 Difference]: With dead ends: 1360 [2019-12-27 15:13:13,350 INFO L226 Difference]: Without dead ends: 1360 [2019-12-27 15:13:13,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=1299, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 15:13:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-12-27 15:13:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1308. [2019-12-27 15:13:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-12-27 15:13:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2413 transitions. [2019-12-27 15:13:13,367 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2413 transitions. Word has length 162 [2019-12-27 15:13:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:13,368 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 2413 transitions. [2019-12-27 15:13:13,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 15:13:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2413 transitions. [2019-12-27 15:13:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 15:13:13,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:13,372 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:13,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:13,577 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1200871905, now seen corresponding path program 12 times [2019-12-27 15:13:13,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:13,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382968999] [2019-12-27 15:13:13,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 0 proven. 1195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382968999] [2019-12-27 15:13:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725443050] [2019-12-27 15:13:14,092 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:19,015 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 15:13:19,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:19,021 INFO L264 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-27 15:13:19,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:19,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 299 treesize of output 283 [2019-12-27 15:13:19,030 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 15:13:19,115 INFO L614 ElimStorePlain]: treesize reduction 243, result has 7.6 percent of original size [2019-12-27 15:13:19,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2019-12-27 15:13:19,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-27 15:13:19,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-27 15:13:19,196 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 25 treesize of output 24 [2019-12-27 15:13:19,197 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-27 15:13:19,249 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:19,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:13:19,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,300 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-27 15:13:19,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-27 15:13:19,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:19,340 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 25 treesize of output 24 [2019-12-27 15:13:19,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,355 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-27 15:13:19,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-27 15:13:19,398 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 34 treesize of output 18 [2019-12-27 15:13:19,398 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,407 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-27 15:13:19,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-12-27 15:13:19,442 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 25 treesize of output 24 [2019-12-27 15:13:19,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-27 15:13:19,504 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:19,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 99 [2019-12-27 15:13:19,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:19,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:19,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,565 INFO L614 ElimStorePlain]: treesize reduction 110, result has 24.7 percent of original size [2019-12-27 15:13:19,566 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,566 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2019-12-27 15:13:19,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:19,597 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 25 treesize of output 24 [2019-12-27 15:13:19,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,607 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-27 15:13:19,607 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-27 15:13:19,619 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 19 treesize of output 7 [2019-12-27 15:13:19,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:19,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:19,620 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-27 15:13:19,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-12-27 15:13:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 488 proven. 20 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-12-27 15:13:19,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:19,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 33 [2019-12-27 15:13:19,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693402288] [2019-12-27 15:13:19,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:19,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:24,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 321 states and 470 transitions. [2019-12-27 15:13:24,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:24,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 15:13:24,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 15:13:24,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:24,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 15:13:24,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:13:24,323 INFO L87 Difference]: Start difference. First operand 1308 states and 2413 transitions. Second operand 23 states. [2019-12-27 15:13:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:24,475 INFO L93 Difference]: Finished difference Result 1420 states and 2617 transitions. [2019-12-27 15:13:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:13:24,476 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 170 [2019-12-27 15:13:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:24,483 INFO L225 Difference]: With dead ends: 1420 [2019-12-27 15:13:24,483 INFO L226 Difference]: Without dead ends: 1420 [2019-12-27 15:13:24,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 15:13:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2019-12-27 15:13:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1368. [2019-12-27 15:13:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-27 15:13:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2522 transitions. [2019-12-27 15:13:24,498 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2522 transitions. Word has length 170 [2019-12-27 15:13:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:24,498 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2522 transitions. [2019-12-27 15:13:24,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 15:13:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2522 transitions. [2019-12-27 15:13:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-27 15:13:24,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:24,502 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:24,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:24,709 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash 666881045, now seen corresponding path program 13 times [2019-12-27 15:13:24,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:24,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481897366] [2019-12-27 15:13:24,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 0 proven. 1316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:25,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481897366] [2019-12-27 15:13:25,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121994664] [2019-12-27 15:13:25,072 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:25,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 15:13:25,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 0 proven. 1316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:25,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:25,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 15:13:25,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986650865] [2019-12-27 15:13:25,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:25,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:31,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 491 transitions. [2019-12-27 15:13:31,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:31,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 15:13:31,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 15:13:31,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 15:13:31,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:13:31,297 INFO L87 Difference]: Start difference. First operand 1368 states and 2522 transitions. Second operand 24 states. [2019-12-27 15:13:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:31,517 INFO L93 Difference]: Finished difference Result 1480 states and 2726 transitions. [2019-12-27 15:13:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:13:31,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 177 [2019-12-27 15:13:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:31,522 INFO L225 Difference]: With dead ends: 1480 [2019-12-27 15:13:31,523 INFO L226 Difference]: Without dead ends: 1480 [2019-12-27 15:13:31,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:13:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-27 15:13:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1428. [2019-12-27 15:13:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-27 15:13:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2631 transitions. [2019-12-27 15:13:31,541 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2631 transitions. Word has length 177 [2019-12-27 15:13:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:31,541 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2631 transitions. [2019-12-27 15:13:31,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 15:13:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2631 transitions. [2019-12-27 15:13:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-27 15:13:31,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:31,544 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:31,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:31,749 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1198733099, now seen corresponding path program 14 times [2019-12-27 15:13:31,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:31,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068912569] [2019-12-27 15:13:31,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:32,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068912569] [2019-12-27 15:13:32,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073785751] [2019-12-27 15:13:32,135 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:32,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 15:13:32,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:32,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 15:13:32,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:32,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:32,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 15:13:32,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1396232186] [2019-12-27 15:13:32,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:32,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:39,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 351 states and 515 transitions. [2019-12-27 15:13:39,246 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:39,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 15:13:39,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 15:13:39,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 15:13:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:13:39,252 INFO L87 Difference]: Start difference. First operand 1428 states and 2631 transitions. Second operand 25 states. [2019-12-27 15:13:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:39,439 INFO L93 Difference]: Finished difference Result 1540 states and 2835 transitions. [2019-12-27 15:13:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 15:13:39,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 185 [2019-12-27 15:13:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:39,446 INFO L225 Difference]: With dead ends: 1540 [2019-12-27 15:13:39,446 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 15:13:39,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-12-27 15:13:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 15:13:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1488. [2019-12-27 15:13:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 15:13:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2740 transitions. [2019-12-27 15:13:39,465 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2740 transitions. Word has length 185 [2019-12-27 15:13:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:39,465 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 2740 transitions. [2019-12-27 15:13:39,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 15:13:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2740 transitions. [2019-12-27 15:13:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-27 15:13:39,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:39,468 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:39,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:39,668 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 471519391, now seen corresponding path program 15 times [2019-12-27 15:13:39,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:39,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795918621] [2019-12-27 15:13:39,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 0 proven. 1585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:40,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795918621] [2019-12-27 15:13:40,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398443846] [2019-12-27 15:13:40,062 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:41,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 15:13:41,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 15:13:41,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-27 15:13:41,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 15:13:41,336 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 13 treesize of output 9 [2019-12-27 15:13:41,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:41,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,345 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-27 15:13:41,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:41,391 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 25 treesize of output 62 [2019-12-27 15:13:41,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,435 INFO L614 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-12-27 15:13:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:41,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:41 [2019-12-27 15:13:41,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:41,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:41,561 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 25 treesize of output 54 [2019-12-27 15:13:41,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:41,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:41,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:41,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-27 15:13:41,588 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,710 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-27 15:13:41,711 INFO L614 ElimStorePlain]: treesize reduction 49, result has 68.0 percent of original size [2019-12-27 15:13:41,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:41,712 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:60 [2019-12-27 15:13:41,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:41,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:41,790 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 25 treesize of output 24 [2019-12-27 15:13:41,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,796 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 15 treesize of output 11 [2019-12-27 15:13:41,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:41,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:41,840 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:41,840 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:60 [2019-12-27 15:13:42,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:42,039 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 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-27 15:13:42,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:42,101 INFO L614 ElimStorePlain]: treesize reduction 10, result has 88.8 percent of original size [2019-12-27 15:13:42,105 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 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-27 15:13:42,105 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:42,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:42,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-27 15:13:42,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:58 [2019-12-27 15:13:42,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:42,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:42,222 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 25 treesize of output 62 [2019-12-27 15:13:42,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:42,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:42,239 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 26 treesize of output 25 [2019-12-27 15:13:42,239 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:42,331 INFO L614 ElimStorePlain]: treesize reduction 24, result has 80.8 percent of original size [2019-12-27 15:13:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:42,334 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 2 xjuncts. [2019-12-27 15:13:42,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:63 [2019-12-27 15:13:45,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:13:45,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 15:13:45,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:45,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 83 [2019-12-27 15:13:45,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:45,627 INFO L614 ElimStorePlain]: treesize reduction 61, result has 29.1 percent of original size [2019-12-27 15:13:45,628 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-27 15:13:45,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-12-27 15:13:45,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 15:13:45,663 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 25 treesize of output 24 [2019-12-27 15:13:45,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:45,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:45,673 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-27 15:13:45,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-27 15:13:45,676 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 19 treesize of output 7 [2019-12-27 15:13:45,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 15:13:45,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 15:13:45,678 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-27 15:13:45,678 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-12-27 15:13:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 280 proven. 110 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2019-12-27 15:13:45,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 15:13:45,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 38 [2019-12-27 15:13:45,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294414349] [2019-12-27 15:13:45,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:45,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:52,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 365 states and 536 transitions. [2019-12-27 15:13:52,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:52,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 15:13:52,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 15:13:52,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 15:13:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1033, Unknown=1, NotChecked=0, Total=1406 [2019-12-27 15:13:52,845 INFO L87 Difference]: Start difference. First operand 1488 states and 2740 transitions. Second operand 26 states. [2019-12-27 15:13:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:53,051 INFO L93 Difference]: Finished difference Result 1600 states and 2944 transitions. [2019-12-27 15:13:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:13:53,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-12-27 15:13:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:53,056 INFO L225 Difference]: With dead ends: 1600 [2019-12-27 15:13:53,057 INFO L226 Difference]: Without dead ends: 1600 [2019-12-27 15:13:53,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=372, Invalid=1033, Unknown=1, NotChecked=0, Total=1406 [2019-12-27 15:13:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2019-12-27 15:13:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1548. [2019-12-27 15:13:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-12-27 15:13:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2849 transitions. [2019-12-27 15:13:53,086 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2849 transitions. Word has length 192 [2019-12-27 15:13:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2849 transitions. [2019-12-27 15:13:53,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 15:13:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2849 transitions. [2019-12-27 15:13:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-27 15:13:53,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:53,091 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:53,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 15:13:53,297 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:53,298 INFO L82 PathProgramCache]: Analyzing trace with hash 545760095, now seen corresponding path program 16 times [2019-12-27 15:13:53,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:53,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491701042] [2019-12-27 15:13:53,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:13:54,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491701042] [2019-12-27 15:13:54,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690388706] [2019-12-27 15:13:54,033 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown