java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:30:13,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:30:13,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:30:13,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:30:13,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:30:13,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:30:13,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:30:13,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:30:13,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:30:13,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:30:13,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:30:13,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:30:13,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:30:13,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:30:13,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:30:13,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:30:13,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:30:13,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:30:13,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:30:13,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:30:13,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:30:13,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:30:13,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:30:13,586 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:30:13,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:30:13,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:30:13,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:30:13,589 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:30:13,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:30:13,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:30:13,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:30:13,590 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:30:13,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:30:13,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:30:13,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:30:13,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:30:13,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:30:13,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:30:13,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:30:13,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:30:13,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:30:13,604 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:30:13,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:30:13,648 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:30:13,651 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:30:13,652 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:30:13,653 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:30:13,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-02 19:30:13,796 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:30:13,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:30:13,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:30:13,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:30:13,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:30:13,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:13,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47719cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13, skipping insertion in model container [2018-02-02 19:30:13,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:13,821 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:30:13,851 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:30:13,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:30:13,966 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:30:13,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13 WrapperNode [2018-02-02 19:30:13,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:30:13,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:30:13,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:30:13,977 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:30:13,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:13,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... [2018-02-02 19:30:14,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:30:14,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:30:14,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:30:14,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:30:14,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 19:30:14,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-02-02 19:30:14,056 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:30:14,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:30:14,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:30:14,058 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:30:14,640 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:30:14,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:30:14 BoogieIcfgContainer [2018-02-02 19:30:14,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:30:14,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:30:14,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:30:14,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:30:14,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:30:13" (1/3) ... [2018-02-02 19:30:14,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2172b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:30:14, skipping insertion in model container [2018-02-02 19:30:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:30:13" (2/3) ... [2018-02-02 19:30:14,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2172b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:30:14, skipping insertion in model container [2018-02-02 19:30:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:30:14" (3/3) ... [2018-02-02 19:30:14,646 INFO L107 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-02 19:30:14,652 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:30:14,658 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 109 error locations. [2018-02-02 19:30:14,681 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:30:14,681 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:30:14,681 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:30:14,681 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:30:14,681 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:30:14,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:30:14,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:30:14,681 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:30:14,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:30:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states. [2018-02-02 19:30:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 19:30:14,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:14,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:14,706 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1556477250, now seen corresponding path program 1 times [2018-02-02 19:30:14,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:14,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:14,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:14,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:14,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:14,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:14,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:14,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:30:14,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 19:30:14,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 19:30:14,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 19:30:14,866 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 2 states. [2018-02-02 19:30:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:14,894 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-02-02 19:30:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 19:30:14,895 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 19:30:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:14,907 INFO L225 Difference]: With dead ends: 313 [2018-02-02 19:30:14,907 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 19:30:14,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 19:30:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 19:30:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-02-02 19:30:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 19:30:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2018-02-02 19:30:14,952 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 9 [2018-02-02 19:30:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:14,952 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2018-02-02 19:30:14,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 19:30:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2018-02-02 19:30:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 19:30:14,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:14,953 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:14,953 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1087749341, now seen corresponding path program 1 times [2018-02-02 19:30:14,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:14,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:14,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:14,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:14,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:14,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:14,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:14,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:30:14,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:30:14,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:30:14,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:30:14,993 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand 3 states. [2018-02-02 19:30:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:15,216 INFO L93 Difference]: Finished difference Result 339 states and 361 transitions. [2018-02-02 19:30:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:30:15,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 19:30:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:15,219 INFO L225 Difference]: With dead ends: 339 [2018-02-02 19:30:15,219 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 19:30:15,220 INFO L554 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 [2018-02-02 19:30:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 19:30:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 300. [2018-02-02 19:30:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 19:30:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2018-02-02 19:30:15,235 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 11 [2018-02-02 19:30:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:15,235 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2018-02-02 19:30:15,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:30:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2018-02-02 19:30:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:30:15,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:15,236 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:15,236 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764336, now seen corresponding path program 1 times [2018-02-02 19:30:15,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:15,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:15,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:15,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:15,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:15,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:15,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:30:15,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:30:15,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:30:15,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:30:15,312 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand 4 states. [2018-02-02 19:30:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:15,497 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2018-02-02 19:30:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:30:15,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:30:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:15,498 INFO L225 Difference]: With dead ends: 328 [2018-02-02 19:30:15,498 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 19:30:15,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 19:30:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 298. [2018-02-02 19:30:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 19:30:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-02-02 19:30:15,509 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 13 [2018-02-02 19:30:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:15,509 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-02-02 19:30:15,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:30:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-02-02 19:30:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 19:30:15,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:15,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:15,510 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764335, now seen corresponding path program 1 times [2018-02-02 19:30:15,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:15,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:15,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:15,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:15,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:15,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:15,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:30:15,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:30:15,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:30:15,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:30:15,543 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 4 states. [2018-02-02 19:30:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:15,689 INFO L93 Difference]: Finished difference Result 315 states and 332 transitions. [2018-02-02 19:30:15,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:30:15,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 19:30:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:15,691 INFO L225 Difference]: With dead ends: 315 [2018-02-02 19:30:15,691 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 19:30:15,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 19:30:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 296. [2018-02-02 19:30:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 19:30:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 310 transitions. [2018-02-02 19:30:15,696 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 310 transitions. Word has length 13 [2018-02-02 19:30:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:15,696 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 310 transitions. [2018-02-02 19:30:15,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:30:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 310 transitions. [2018-02-02 19:30:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:30:15,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:15,696 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:15,696 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash 45229303, now seen corresponding path program 1 times [2018-02-02 19:30:15,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:15,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:15,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:15,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:15,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:15,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:15,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:30:15,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:30:15,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:30:15,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:30:15,742 INFO L87 Difference]: Start difference. First operand 296 states and 310 transitions. Second operand 3 states. [2018-02-02 19:30:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:15,758 INFO L93 Difference]: Finished difference Result 315 states and 327 transitions. [2018-02-02 19:30:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:30:15,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 19:30:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:15,760 INFO L225 Difference]: With dead ends: 315 [2018-02-02 19:30:15,760 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 19:30:15,761 INFO L554 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 [2018-02-02 19:30:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 19:30:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2018-02-02 19:30:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 19:30:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 308 transitions. [2018-02-02 19:30:15,765 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 308 transitions. Word has length 17 [2018-02-02 19:30:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:15,765 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 308 transitions. [2018-02-02 19:30:15,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:30:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 308 transitions. [2018-02-02 19:30:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:30:15,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:15,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:15,766 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 963226955, now seen corresponding path program 1 times [2018-02-02 19:30:15,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:15,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:15,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:15,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:15,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:15,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:15,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:30:15,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:30:15,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:30:15,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:30:15,844 INFO L87 Difference]: Start difference. First operand 295 states and 308 transitions. Second operand 4 states. [2018-02-02 19:30:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:15,971 INFO L93 Difference]: Finished difference Result 329 states and 345 transitions. [2018-02-02 19:30:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:30:15,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 19:30:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:15,973 INFO L225 Difference]: With dead ends: 329 [2018-02-02 19:30:15,973 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 19:30:15,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 19:30:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2018-02-02 19:30:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 19:30:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 306 transitions. [2018-02-02 19:30:15,977 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 306 transitions. Word has length 20 [2018-02-02 19:30:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:15,977 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 306 transitions. [2018-02-02 19:30:15,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:30:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 306 transitions. [2018-02-02 19:30:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:30:15,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:15,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:15,978 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash 963226954, now seen corresponding path program 1 times [2018-02-02 19:30:15,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:15,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:15,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,979 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:15,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:15,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:16,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:16,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:30:16,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:30:16,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:30:16,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:30:16,008 INFO L87 Difference]: Start difference. First operand 293 states and 306 transitions. Second operand 4 states. [2018-02-02 19:30:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:16,131 INFO L93 Difference]: Finished difference Result 316 states and 331 transitions. [2018-02-02 19:30:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:30:16,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 19:30:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:16,132 INFO L225 Difference]: With dead ends: 316 [2018-02-02 19:30:16,132 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 19:30:16,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 19:30:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 291. [2018-02-02 19:30:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 19:30:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 304 transitions. [2018-02-02 19:30:16,136 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 304 transitions. Word has length 20 [2018-02-02 19:30:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:16,137 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 304 transitions. [2018-02-02 19:30:16,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:30:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 304 transitions. [2018-02-02 19:30:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 19:30:16,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:16,137 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:16,138 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1725402921, now seen corresponding path program 1 times [2018-02-02 19:30:16,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:16,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:16,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:16,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:16,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:16,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:16,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:30:16,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:30:16,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:30:16,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:16,175 INFO L87 Difference]: Start difference. First operand 291 states and 304 transitions. Second operand 5 states. [2018-02-02 19:30:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:16,231 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions. [2018-02-02 19:30:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:30:16,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-02 19:30:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:16,232 INFO L225 Difference]: With dead ends: 331 [2018-02-02 19:30:16,232 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 19:30:16,233 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:30:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 19:30:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-02-02 19:30:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 19:30:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 303 transitions. [2018-02-02 19:30:16,238 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 303 transitions. Word has length 27 [2018-02-02 19:30:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:16,238 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 303 transitions. [2018-02-02 19:30:16,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:30:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 303 transitions. [2018-02-02 19:30:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:30:16,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:16,239 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:16,239 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365059, now seen corresponding path program 1 times [2018-02-02 19:30:16,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:16,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:16,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:16,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:16,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:16,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:16,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:30:16,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:30:16,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:30:16,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:30:16,289 INFO L87 Difference]: Start difference. First operand 291 states and 303 transitions. Second operand 6 states. [2018-02-02 19:30:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:16,584 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2018-02-02 19:30:16,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:30:16,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 19:30:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:16,586 INFO L225 Difference]: With dead ends: 309 [2018-02-02 19:30:16,586 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 19:30:16,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:30:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 19:30:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-02-02 19:30:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 19:30:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 300 transitions. [2018-02-02 19:30:16,592 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 300 transitions. Word has length 33 [2018-02-02 19:30:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:16,592 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 300 transitions. [2018-02-02 19:30:16,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:30:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 300 transitions. [2018-02-02 19:30:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:30:16,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:16,593 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:16,595 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365060, now seen corresponding path program 1 times [2018-02-02 19:30:16,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:16,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:16,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:16,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:16,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:16,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:16,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:30:16,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:30:16,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:30:16,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:30:16,684 INFO L87 Difference]: Start difference. First operand 286 states and 300 transitions. Second operand 7 states. [2018-02-02 19:30:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:17,066 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2018-02-02 19:30:17,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:30:17,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 19:30:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:17,068 INFO L225 Difference]: With dead ends: 359 [2018-02-02 19:30:17,068 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 19:30:17,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 19:30:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2018-02-02 19:30:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 19:30:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2018-02-02 19:30:17,074 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 33 [2018-02-02 19:30:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:17,075 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2018-02-02 19:30:17,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:30:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2018-02-02 19:30:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:30:17,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:17,076 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:17,076 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:17,076 INFO L82 PathProgramCache]: Analyzing trace with hash 816569686, now seen corresponding path program 1 times [2018-02-02 19:30:17,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:17,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:17,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:17,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:17,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:17,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:17,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:17,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:30:17,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:30:17,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:30:17,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:30:17,216 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand 11 states. [2018-02-02 19:30:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:17,864 INFO L93 Difference]: Finished difference Result 336 states and 352 transitions. [2018-02-02 19:30:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:30:17,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 19:30:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:17,866 INFO L225 Difference]: With dead ends: 336 [2018-02-02 19:30:17,866 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 19:30:17,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:30:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 19:30:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-02-02 19:30:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 19:30:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 341 transitions. [2018-02-02 19:30:17,873 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 341 transitions. Word has length 48 [2018-02-02 19:30:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:17,873 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 341 transitions. [2018-02-02 19:30:17,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:30:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 341 transitions. [2018-02-02 19:30:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:30:17,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:17,874 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:17,874 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash 816569687, now seen corresponding path program 1 times [2018-02-02 19:30:17,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:17,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:17,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:17,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:17,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:17,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:18,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:18,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:30:18,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:30:18,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:30:18,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:18,045 INFO L87 Difference]: Start difference. First operand 323 states and 341 transitions. Second operand 10 states. [2018-02-02 19:30:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:18,540 INFO L93 Difference]: Finished difference Result 348 states and 364 transitions. [2018-02-02 19:30:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:30:18,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-02-02 19:30:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:18,541 INFO L225 Difference]: With dead ends: 348 [2018-02-02 19:30:18,541 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 19:30:18,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:30:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 19:30:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 323. [2018-02-02 19:30:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 19:30:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 340 transitions. [2018-02-02 19:30:18,547 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 340 transitions. Word has length 48 [2018-02-02 19:30:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:18,547 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 340 transitions. [2018-02-02 19:30:18,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:30:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 340 transitions. [2018-02-02 19:30:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:30:18,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:18,548 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:18,548 INFO L371 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918648, now seen corresponding path program 1 times [2018-02-02 19:30:18,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:18,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:18,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:18,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:18,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:18,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:18,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:18,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:30:18,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 19:30:18,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 19:30:18,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 19:30:18,663 INFO L87 Difference]: Start difference. First operand 323 states and 340 transitions. Second operand 11 states. [2018-02-02 19:30:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:19,147 INFO L93 Difference]: Finished difference Result 334 states and 350 transitions. [2018-02-02 19:30:19,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:30:19,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 19:30:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:19,149 INFO L225 Difference]: With dead ends: 334 [2018-02-02 19:30:19,149 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 19:30:19,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:30:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 19:30:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 323. [2018-02-02 19:30:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 19:30:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 339 transitions. [2018-02-02 19:30:19,154 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 339 transitions. Word has length 48 [2018-02-02 19:30:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:19,154 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 339 transitions. [2018-02-02 19:30:19,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 19:30:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 339 transitions. [2018-02-02 19:30:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 19:30:19,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:19,155 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:19,155 INFO L371 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918649, now seen corresponding path program 1 times [2018-02-02 19:30:19,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:19,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:19,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:19,156 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:19,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:19,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:19,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:19,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:30:19,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:30:19,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:30:19,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:19,295 INFO L87 Difference]: Start difference. First operand 323 states and 339 transitions. Second operand 10 states. [2018-02-02 19:30:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:19,704 INFO L93 Difference]: Finished difference Result 346 states and 362 transitions. [2018-02-02 19:30:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:30:19,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-02-02 19:30:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:19,705 INFO L225 Difference]: With dead ends: 346 [2018-02-02 19:30:19,705 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 19:30:19,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 19:30:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 19:30:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2018-02-02 19:30:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 19:30:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 338 transitions. [2018-02-02 19:30:19,709 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 338 transitions. Word has length 48 [2018-02-02 19:30:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:19,709 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 338 transitions. [2018-02-02 19:30:19,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:30:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 338 transitions. [2018-02-02 19:30:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 19:30:19,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:19,709 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:19,709 INFO L371 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1300121728, now seen corresponding path program 1 times [2018-02-02 19:30:19,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:19,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:19,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:19,710 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:19,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:19,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:19,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:19,979 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:19,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:20,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:20,102 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:20,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:20,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,111 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:20,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:20,119 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-02 19:30:20,151 INFO L477 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 15 [2018-02-02 19:30:20,152 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:20,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,172 INFO L477 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 15 [2018-02-02 19:30:20,176 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:20,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:20,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:10 [2018-02-02 19:30:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:20,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:20,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 16 [2018-02-02 19:30:20,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:30:20,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:30:20,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:30:20,232 INFO L87 Difference]: Start difference. First operand 323 states and 338 transitions. Second operand 16 states. [2018-02-02 19:30:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:20,692 INFO L93 Difference]: Finished difference Result 393 states and 412 transitions. [2018-02-02 19:30:20,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:30:20,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-02 19:30:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:20,693 INFO L225 Difference]: With dead ends: 393 [2018-02-02 19:30:20,693 INFO L226 Difference]: Without dead ends: 393 [2018-02-02 19:30:20,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 19:30:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-02 19:30:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2018-02-02 19:30:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 19:30:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 382 transitions. [2018-02-02 19:30:20,701 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 382 transitions. Word has length 54 [2018-02-02 19:30:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:20,701 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 382 transitions. [2018-02-02 19:30:20,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:30:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 382 transitions. [2018-02-02 19:30:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 19:30:20,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:20,702 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:20,702 INFO L371 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash 387977136, now seen corresponding path program 1 times [2018-02-02 19:30:20,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:20,702 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:20,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:20,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:20,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:20,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:30:20,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:20,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:30:20,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:30:20,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:30:20,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:20,743 INFO L87 Difference]: Start difference. First operand 366 states and 382 transitions. Second operand 5 states. [2018-02-02 19:30:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:20,958 INFO L93 Difference]: Finished difference Result 386 states and 405 transitions. [2018-02-02 19:30:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:30:20,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-02-02 19:30:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:20,960 INFO L225 Difference]: With dead ends: 386 [2018-02-02 19:30:20,960 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 19:30:20,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:30:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 19:30:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 367. [2018-02-02 19:30:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-02 19:30:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 385 transitions. [2018-02-02 19:30:20,967 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 385 transitions. Word has length 60 [2018-02-02 19:30:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:20,967 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 385 transitions. [2018-02-02 19:30:20,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:30:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 385 transitions. [2018-02-02 19:30:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 19:30:20,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:20,968 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:20,968 INFO L371 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 387977137, now seen corresponding path program 1 times [2018-02-02 19:30:20,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:20,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:20,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:20,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:20,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:20,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:21,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:21,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:30:21,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:30:21,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:30:21,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:30:21,063 INFO L87 Difference]: Start difference. First operand 367 states and 385 transitions. Second operand 7 states. [2018-02-02 19:30:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:21,396 INFO L93 Difference]: Finished difference Result 398 states and 420 transitions. [2018-02-02 19:30:21,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:30:21,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 19:30:21,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:21,398 INFO L225 Difference]: With dead ends: 398 [2018-02-02 19:30:21,398 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 19:30:21,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 19:30:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 380. [2018-02-02 19:30:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 19:30:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 401 transitions. [2018-02-02 19:30:21,404 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 401 transitions. Word has length 60 [2018-02-02 19:30:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:21,405 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 401 transitions. [2018-02-02 19:30:21,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:30:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 401 transitions. [2018-02-02 19:30:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 19:30:21,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:21,406 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:21,406 INFO L371 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash -555377704, now seen corresponding path program 1 times [2018-02-02 19:30:21,406 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:21,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:21,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:21,407 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:21,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:21,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:30:21,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:21,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:30:21,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:30:21,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:30:21,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:30:21,439 INFO L87 Difference]: Start difference. First operand 380 states and 401 transitions. Second operand 5 states. [2018-02-02 19:30:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:21,651 INFO L93 Difference]: Finished difference Result 377 states and 398 transitions. [2018-02-02 19:30:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:30:21,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-02-02 19:30:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:21,653 INFO L225 Difference]: With dead ends: 377 [2018-02-02 19:30:21,653 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 19:30:21,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:30:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 19:30:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-02-02 19:30:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-02 19:30:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 398 transitions. [2018-02-02 19:30:21,658 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 398 transitions. Word has length 62 [2018-02-02 19:30:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:21,659 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 398 transitions. [2018-02-02 19:30:21,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:30:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 398 transitions. [2018-02-02 19:30:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 19:30:21,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:21,659 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:21,660 INFO L371 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -555377703, now seen corresponding path program 1 times [2018-02-02 19:30:21,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:21,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:21,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:21,661 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:21,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:21,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:21,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:21,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:30:21,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:30:21,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:30:21,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:30:21,761 INFO L87 Difference]: Start difference. First operand 377 states and 398 transitions. Second operand 7 states. [2018-02-02 19:30:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:22,059 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2018-02-02 19:30:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:30:22,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-02-02 19:30:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:22,061 INFO L225 Difference]: With dead ends: 422 [2018-02-02 19:30:22,061 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 19:30:22,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 19:30:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 403. [2018-02-02 19:30:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-02 19:30:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 430 transitions. [2018-02-02 19:30:22,066 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 430 transitions. Word has length 62 [2018-02-02 19:30:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:22,066 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 430 transitions. [2018-02-02 19:30:22,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:30:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 430 transitions. [2018-02-02 19:30:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 19:30:22,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:22,066 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:22,067 INFO L371 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1681231164, now seen corresponding path program 1 times [2018-02-02 19:30:22,067 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:22,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:22,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:22,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:22,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:22,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:22,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:22,254 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:22,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:22,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:22,312 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:22,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:22,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,317 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:22,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:22,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-02 19:30:22,396 INFO L477 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 15 treesize of output 11 [2018-02-02 19:30:22,398 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 19:30:22,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,403 INFO L477 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 15 treesize of output 11 [2018-02-02 19:30:22,405 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 19:30:22,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:22,409 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-02 19:30:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:22,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:22,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2018-02-02 19:30:22,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 19:30:22,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 19:30:22,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 19:30:22,462 INFO L87 Difference]: Start difference. First operand 403 states and 430 transitions. Second operand 15 states. [2018-02-02 19:30:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:22,821 INFO L93 Difference]: Finished difference Result 461 states and 489 transitions. [2018-02-02 19:30:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:30:22,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-02-02 19:30:22,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:22,823 INFO L225 Difference]: With dead ends: 461 [2018-02-02 19:30:22,823 INFO L226 Difference]: Without dead ends: 461 [2018-02-02 19:30:22,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:30:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-02-02 19:30:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 406. [2018-02-02 19:30:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-02-02 19:30:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 433 transitions. [2018-02-02 19:30:22,829 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 433 transitions. Word has length 64 [2018-02-02 19:30:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:22,829 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 433 transitions. [2018-02-02 19:30:22,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 19:30:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 433 transitions. [2018-02-02 19:30:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 19:30:22,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:22,830 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:22,830 INFO L371 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785484, now seen corresponding path program 2 times [2018-02-02 19:30:22,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:22,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:22,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:22,831 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:22,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:22,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:23,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:23,106 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:23,111 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:30:23,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 19:30:23,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:30:23,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:23,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-02 19:30:23,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-02 19:30:23,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-02 19:30:23,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 19:30:23,238 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:23,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:23,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-02-02 19:30:23,378 INFO L477 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 21 treesize of output 17 [2018-02-02 19:30:23,391 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:23,392 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 19:30:23,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:23,402 INFO L267 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. [2018-02-02 19:30:23,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:11 [2018-02-02 19:30:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:23,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:23,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2018-02-02 19:30:23,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:30:23,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:30:23,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-02-02 19:30:23,441 INFO L87 Difference]: Start difference. First operand 406 states and 433 transitions. Second operand 27 states. [2018-02-02 19:30:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:24,648 INFO L93 Difference]: Finished difference Result 427 states and 455 transitions. [2018-02-02 19:30:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 19:30:24,649 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-02-02 19:30:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:24,650 INFO L225 Difference]: With dead ends: 427 [2018-02-02 19:30:24,650 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 19:30:24,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 19:30:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 19:30:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 409. [2018-02-02 19:30:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 19:30:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 437 transitions. [2018-02-02 19:30:24,656 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 437 transitions. Word has length 70 [2018-02-02 19:30:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:24,656 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 437 transitions. [2018-02-02 19:30:24,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:30:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 437 transitions. [2018-02-02 19:30:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 19:30:24,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:24,657 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:24,657 INFO L371 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785483, now seen corresponding path program 1 times [2018-02-02 19:30:24,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:24,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:24,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:24,658 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:30:24,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:24,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:25,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:25,060 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:25,065 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:25,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:25,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-02-02 19:30:25,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:30:25,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-02-02 19:30:25,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:25,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 19:30:25,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-02-02 19:30:25,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:25,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2018-02-02 19:30:25,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:30:25,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:30:25,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:30:25,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:25,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:25,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:61 [2018-02-02 19:30:25,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2018-02-02 19:30:25,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-02-02 19:30:25,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 19:30:25,559 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:25,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:25,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:25,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:79, output treesize:31 [2018-02-02 19:30:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:25,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:25,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-02-02 19:30:25,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 19:30:25,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 19:30:25,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=953, Unknown=1, NotChecked=0, Total=1056 [2018-02-02 19:30:25,681 INFO L87 Difference]: Start difference. First operand 409 states and 437 transitions. Second operand 33 states. [2018-02-02 19:30:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:28,367 INFO L93 Difference]: Finished difference Result 490 states and 519 transitions. [2018-02-02 19:30:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 19:30:28,367 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-02-02 19:30:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:28,368 INFO L225 Difference]: With dead ends: 490 [2018-02-02 19:30:28,368 INFO L226 Difference]: Without dead ends: 490 [2018-02-02 19:30:28,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=482, Invalid=2379, Unknown=1, NotChecked=0, Total=2862 [2018-02-02 19:30:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-02-02 19:30:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 440. [2018-02-02 19:30:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-02-02 19:30:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 470 transitions. [2018-02-02 19:30:28,372 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 470 transitions. Word has length 70 [2018-02-02 19:30:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:28,372 INFO L432 AbstractCegarLoop]: Abstraction has 440 states and 470 transitions. [2018-02-02 19:30:28,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 19:30:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 470 transitions. [2018-02-02 19:30:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:30:28,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:28,373 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:28,373 INFO L371 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -416395486, now seen corresponding path program 1 times [2018-02-02 19:30:28,373 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:28,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:28,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:28,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:28,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:28,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:30:28,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:28,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:30:28,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:30:28,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:30:28,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:30:28,479 INFO L87 Difference]: Start difference. First operand 440 states and 470 transitions. Second operand 10 states. [2018-02-02 19:30:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:28,842 INFO L93 Difference]: Finished difference Result 483 states and 515 transitions. [2018-02-02 19:30:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:30:28,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-02-02 19:30:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:28,843 INFO L225 Difference]: With dead ends: 483 [2018-02-02 19:30:28,843 INFO L226 Difference]: Without dead ends: 483 [2018-02-02 19:30:28,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:30:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-02 19:30:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 474. [2018-02-02 19:30:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-02-02 19:30:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 509 transitions. [2018-02-02 19:30:28,850 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 509 transitions. Word has length 73 [2018-02-02 19:30:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:28,851 INFO L432 AbstractCegarLoop]: Abstraction has 474 states and 509 transitions. [2018-02-02 19:30:28,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:30:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 509 transitions. [2018-02-02 19:30:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 19:30:28,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:28,852 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:28,852 INFO L371 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash -416395485, now seen corresponding path program 1 times [2018-02-02 19:30:28,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:28,852 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:28,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:28,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:28,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:28,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:29,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:29,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 19:30:29,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:30:29,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:30:29,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:30:29,031 INFO L87 Difference]: Start difference. First operand 474 states and 509 transitions. Second operand 14 states. [2018-02-02 19:30:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:29,756 INFO L93 Difference]: Finished difference Result 517 states and 550 transitions. [2018-02-02 19:30:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 19:30:29,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 19:30:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:29,757 INFO L225 Difference]: With dead ends: 517 [2018-02-02 19:30:29,757 INFO L226 Difference]: Without dead ends: 517 [2018-02-02 19:30:29,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-02-02 19:30:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-02-02 19:30:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 478. [2018-02-02 19:30:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-02-02 19:30:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 513 transitions. [2018-02-02 19:30:29,763 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 513 transitions. Word has length 73 [2018-02-02 19:30:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:29,763 INFO L432 AbstractCegarLoop]: Abstraction has 478 states and 513 transitions. [2018-02-02 19:30:29,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:30:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 513 transitions. [2018-02-02 19:30:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 19:30:29,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:29,764 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:29,764 INFO L371 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2030774639, now seen corresponding path program 1 times [2018-02-02 19:30:29,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:29,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:29,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:29,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:29,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:29,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 19:30:29,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:29,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 19:30:29,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:30:29,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:30:29,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:30:29,904 INFO L87 Difference]: Start difference. First operand 478 states and 513 transitions. Second operand 12 states. [2018-02-02 19:30:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:30,237 INFO L93 Difference]: Finished difference Result 487 states and 518 transitions. [2018-02-02 19:30:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 19:30:30,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-02-02 19:30:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:30,238 INFO L225 Difference]: With dead ends: 487 [2018-02-02 19:30:30,238 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 19:30:30,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:30:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 19:30:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 470. [2018-02-02 19:30:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-02 19:30:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 499 transitions. [2018-02-02 19:30:30,244 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 499 transitions. Word has length 78 [2018-02-02 19:30:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:30,244 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 499 transitions. [2018-02-02 19:30:30,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:30:30,245 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 499 transitions. [2018-02-02 19:30:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 19:30:30,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:30,245 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:30,246 INFO L371 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:30,246 INFO L82 PathProgramCache]: Analyzing trace with hash -891514256, now seen corresponding path program 2 times [2018-02-02 19:30:30,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:30,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:30,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:30,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:30,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:30,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:30,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:30,482 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:30,486 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 19:30:30,500 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 19:30:30,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 19:30:30,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:30,569 INFO L477 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 15 [2018-02-02 19:30:30,570 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:30,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:30,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:30,574 INFO L477 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 15 [2018-02-02 19:30:30,575 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:30,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:30,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:30,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:30,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-02-02 19:30:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 19:30:30,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 19:30:30,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2018-02-02 19:30:30,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:30:30,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:30:30,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-02 19:30:30,620 INFO L87 Difference]: Start difference. First operand 470 states and 499 transitions. Second operand 25 states. [2018-02-02 19:30:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:31,234 INFO L93 Difference]: Finished difference Result 512 states and 540 transitions. [2018-02-02 19:30:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 19:30:31,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-02-02 19:30:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:31,235 INFO L225 Difference]: With dead ends: 512 [2018-02-02 19:30:31,235 INFO L226 Difference]: Without dead ends: 494 [2018-02-02 19:30:31,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 19:30:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-02 19:30:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 449. [2018-02-02 19:30:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-02-02 19:30:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 476 transitions. [2018-02-02 19:30:31,239 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 476 transitions. Word has length 80 [2018-02-02 19:30:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:31,239 INFO L432 AbstractCegarLoop]: Abstraction has 449 states and 476 transitions. [2018-02-02 19:30:31,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:30:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 476 transitions. [2018-02-02 19:30:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 19:30:31,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:31,240 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:31,241 INFO L371 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785373, now seen corresponding path program 1 times [2018-02-02 19:30:31,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:31,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:31,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:31,242 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 19:30:31,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:31,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:31,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:31,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 19:30:31,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 19:30:31,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 19:30:31,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:30:31,410 INFO L87 Difference]: Start difference. First operand 449 states and 476 transitions. Second operand 14 states. [2018-02-02 19:30:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:31,989 INFO L93 Difference]: Finished difference Result 473 states and 500 transitions. [2018-02-02 19:30:31,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 19:30:31,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-02-02 19:30:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:31,990 INFO L225 Difference]: With dead ends: 473 [2018-02-02 19:30:31,990 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 19:30:31,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-02-02 19:30:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 19:30:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 454. [2018-02-02 19:30:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 19:30:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 483 transitions. [2018-02-02 19:30:31,994 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 483 transitions. Word has length 86 [2018-02-02 19:30:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:31,994 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 483 transitions. [2018-02-02 19:30:31,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 19:30:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 483 transitions. [2018-02-02 19:30:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 19:30:31,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:31,995 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:31,995 INFO L371 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785372, now seen corresponding path program 1 times [2018-02-02 19:30:31,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:31,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:31,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:31,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:31,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:32,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:32,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:30:32,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 19:30:32,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 19:30:32,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 19:30:32,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 19:30:32,132 INFO L87 Difference]: Start difference. First operand 454 states and 483 transitions. Second operand 12 states. [2018-02-02 19:30:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:32,481 INFO L93 Difference]: Finished difference Result 484 states and 511 transitions. [2018-02-02 19:30:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 19:30:32,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2018-02-02 19:30:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:32,483 INFO L225 Difference]: With dead ends: 484 [2018-02-02 19:30:32,483 INFO L226 Difference]: Without dead ends: 484 [2018-02-02 19:30:32,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-02 19:30:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-02 19:30:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 456. [2018-02-02 19:30:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-02 19:30:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 484 transitions. [2018-02-02 19:30:32,486 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 484 transitions. Word has length 86 [2018-02-02 19:30:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:32,487 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 484 transitions. [2018-02-02 19:30:32,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 19:30:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 484 transitions. [2018-02-02 19:30:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 19:30:32,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:32,487 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:32,487 INFO L371 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367099, now seen corresponding path program 1 times [2018-02-02 19:30:32,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:32,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:32,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:32,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:32,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:32,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:33,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:33,306 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:33,311 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:33,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:33,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-02 19:30:33,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 19:30:33,446 INFO L477 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 32 treesize of output 29 [2018-02-02 19:30:33,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:33,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,463 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:30:33,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,501 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:65, output treesize:25 [2018-02-02 19:30:33,546 INFO L477 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 23 treesize of output 18 [2018-02-02 19:30:33,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 25 [2018-02-02 19:30:33,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2018-02-02 19:30:33,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-02-02 19:30:33,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:42 [2018-02-02 19:30:33,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 19:30:33,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:33,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2018-02-02 19:30:33,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-02-02 19:30:33,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-02-02 19:30:33,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:33,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:49 [2018-02-02 19:30:33,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-02-02 19:30:33,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:33,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:33,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:57 [2018-02-02 19:30:33,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:33,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 72 [2018-02-02 19:30:33,995 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:33,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-02-02 19:30:33,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:34,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-02 19:30:34,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2018-02-02 19:30:34,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 19:30:34,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-02 19:30:34,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-02 19:30:34,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:276 [2018-02-02 19:30:34,398 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 74 DAG size of output 47 [2018-02-02 19:30:34,403 INFO L477 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 77 treesize of output 74 [2018-02-02 19:30:34,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:34,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,422 INFO L477 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 102 treesize of output 99 [2018-02-02 19:30:34,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:34,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,441 INFO L477 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 76 treesize of output 73 [2018-02-02 19:30:34,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:34,443 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-02-02 19:30:34,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-02-02 19:30:34,523 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,533 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 89 [2018-02-02 19:30:34,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,604 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-02 19:30:34,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:30:34,622 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 126 [2018-02-02 19:30:34,692 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:34,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 108 [2018-02-02 19:30:34,765 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:34,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:34,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 100 [2018-02-02 19:30:34,830 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-02 19:30:34,877 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:30:34,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 19:30:34,930 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:256, output treesize:301 [2018-02-02 19:30:35,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 89 treesize of output 83 [2018-02-02 19:30:35,346 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-02-02 19:30:35,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,396 INFO L477 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 148 treesize of output 138 [2018-02-02 19:30:35,397 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-02-02 19:30:35,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,452 INFO L477 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 117 treesize of output 107 [2018-02-02 19:30:35,454 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2018-02-02 19:30:35,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:35,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-02-02 19:30:35,502 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:355, output treesize:268 [2018-02-02 19:30:36,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 84 [2018-02-02 19:30:36,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,091 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-02-02 19:30:36,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 19:30:36,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-02-02 19:30:36,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:36,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:36,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 116 [2018-02-02 19:30:36,193 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 97 [2018-02-02 19:30:36,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:36,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 83 [2018-02-02 19:30:36,254 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:36,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 59 [2018-02-02 19:30:36,312 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:36,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:36,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2018-02-02 19:30:36,345 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:36,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 69 [2018-02-02 19:30:36,380 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 19:30:36,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-02 19:30:36,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-02-02 19:30:36,502 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:238, output treesize:140 [2018-02-02 19:30:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:36,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:36,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-02-02 19:30:36,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 19:30:36,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 19:30:36,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:30:36,653 INFO L87 Difference]: Start difference. First operand 456 states and 484 transitions. Second operand 46 states. [2018-02-02 19:30:37,439 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 94 DAG size of output 69 [2018-02-02 19:30:37,774 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 124 DAG size of output 94 [2018-02-02 19:30:38,040 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 148 DAG size of output 114 [2018-02-02 19:30:38,338 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 152 DAG size of output 118 [2018-02-02 19:30:38,658 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 156 DAG size of output 122 [2018-02-02 19:30:38,838 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 101 [2018-02-02 19:30:39,280 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 110 DAG size of output 102 [2018-02-02 19:30:39,629 WARN L143 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 164 [2018-02-02 19:30:39,782 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-02 19:30:39,963 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 145 [2018-02-02 19:30:40,386 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 134 [2018-02-02 19:30:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:41,510 INFO L93 Difference]: Finished difference Result 469 states and 495 transitions. [2018-02-02 19:30:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:30:41,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2018-02-02 19:30:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:41,511 INFO L225 Difference]: With dead ends: 469 [2018-02-02 19:30:41,511 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 19:30:41,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=577, Invalid=4115, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 19:30:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 19:30:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2018-02-02 19:30:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 19:30:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2018-02-02 19:30:41,515 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 486 transitions. Word has length 85 [2018-02-02 19:30:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:41,515 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 486 transitions. [2018-02-02 19:30:41,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 19:30:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 486 transitions. [2018-02-02 19:30:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 19:30:41,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:41,516 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:30:41,516 INFO L371 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367098, now seen corresponding path program 1 times [2018-02-02 19:30:41,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:41,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:41,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:41,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:41,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:41,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:42,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:42,678 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:42,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:42,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:42,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-02-02 19:30:42,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 19:30:42,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-02-02 19:30:42,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 19:30:42,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-02-02 19:30:42,839 INFO L477 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 11 treesize of output 8 [2018-02-02 19:30:42,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:42,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,859 INFO L477 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 11 treesize of output 8 [2018-02-02 19:30:42,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:42,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:50 [2018-02-02 19:30:42,904 INFO L477 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 16 [2018-02-02 19:30:42,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2018-02-02 19:30:42,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,922 INFO L477 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 40 treesize of output 31 [2018-02-02 19:30:42,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 42 [2018-02-02 19:30:42,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2018-02-02 19:30:42,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-02-02 19:30:42,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:42,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-02 19:30:42,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:42,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-02-02 19:30:43,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-02-02 19:30:43,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:43,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-02 19:30:43,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:43,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-02-02 19:30:43,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-02-02 19:30:43,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-02-02 19:30:43,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-02 19:30:43,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-02-02 19:30:43,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2018-02-02 19:30:43,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-02-02 19:30:43,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-02-02 19:30:43,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:91 [2018-02-02 19:30:43,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-02-02 19:30:43,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-02 19:30:43,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-02 19:30:43,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:43,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:122 [2018-02-02 19:30:43,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 115 [2018-02-02 19:30:43,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,588 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2018-02-02 19:30:43,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:30:43,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-02-02 19:30:43,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:43,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 37 treesize of output 46 [2018-02-02 19:30:43,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:43,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:212 [2018-02-02 19:30:44,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:44,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:44,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 179 [2018-02-02 19:30:44,108 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-02 19:30:44,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:44,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 24 [2018-02-02 19:30:44,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:44,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 74 [2018-02-02 19:30:44,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:44,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:44,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-02-02 19:30:44,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:44,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-02-02 19:30:44,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:44,185 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:30:44,185 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:44,190 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 19:30:44,190 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:44,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:44,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:44,203 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:250, output treesize:48 [2018-02-02 19:30:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:44,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:44,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-02-02 19:30:44,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 19:30:44,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 19:30:44,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 19:30:44,305 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 45 states. [2018-02-02 19:30:45,558 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 132 DAG size of output 100 [2018-02-02 19:30:45,798 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 155 DAG size of output 123 [2018-02-02 19:30:46,075 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 170 DAG size of output 130 [2018-02-02 19:30:48,418 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 176 DAG size of output 136 [2018-02-02 19:30:48,716 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 171 DAG size of output 129 [2018-02-02 19:30:49,083 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 101 DAG size of output 92 [2018-02-02 19:30:49,293 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 97 DAG size of output 93 [2018-02-02 19:30:50,910 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 150 DAG size of output 112 [2018-02-02 19:30:51,209 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 159 DAG size of output 108 [2018-02-02 19:30:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:30:51,546 INFO L93 Difference]: Finished difference Result 506 states and 531 transitions. [2018-02-02 19:30:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 19:30:51,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2018-02-02 19:30:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:30:51,547 INFO L225 Difference]: With dead ends: 506 [2018-02-02 19:30:51,547 INFO L226 Difference]: Without dead ends: 506 [2018-02-02 19:30:51,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=669, Invalid=4301, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 19:30:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-02-02 19:30:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 457. [2018-02-02 19:30:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 19:30:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 485 transitions. [2018-02-02 19:30:51,552 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 485 transitions. Word has length 85 [2018-02-02 19:30:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:30:51,552 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 485 transitions. [2018-02-02 19:30:51,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 19:30:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 485 transitions. [2018-02-02 19:30:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 19:30:51,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:30:51,553 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 19:30:51,553 INFO L371 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-02 19:30:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1038018137, now seen corresponding path program 1 times [2018-02-02 19:30:51,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:30:51,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:30:51,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:51,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:51,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:30:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:51,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:30:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:52,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:30:52,410 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:30:52,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:30:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:30:52,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:30:52,530 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:52,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:52,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,538 INFO L477 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 13 treesize of output 10 [2018-02-02 19:30:52,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-02-02 19:30:52,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-02-02 19:30:52,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:52,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:52,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:30:52,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-02-02 19:30:52,660 INFO L477 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 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-02 19:30:52,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:52,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,684 INFO L477 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 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-02 19:30:52,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-02-02 19:30:52,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-02-02 19:30:52,731 INFO L477 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 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 19:30:52,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:52,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-02-02 19:30:52,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,752 INFO L477 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 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 19:30:52,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:52,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-02-02 19:30:52,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2018-02-02 19:30:52,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-02-02 19:30:52,868 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 19:30:52,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 24 [2018-02-02 19:30:52,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:52,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-02-02 19:30:52,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-02-02 19:30:52,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 39 [2018-02-02 19:30:53,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:30:53,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:30:53,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:30:53,053 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:130 [2018-02-02 19:30:53,154 INFO L477 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 0 case distinctions, treesize of input 75 treesize of output 70 [2018-02-02 19:30:53,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,158 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:53,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 30 [2018-02-02 19:30:53,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 119 [2018-02-02 19:30:53,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,243 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:53,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 112 [2018-02-02 19:30:53,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 105 [2018-02-02 19:30:53,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 106 [2018-02-02 19:30:53,539 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 19:30:53,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 19:30:53,750 INFO L477 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 0 case distinctions, treesize of input 71 treesize of output 66 [2018-02-02 19:30:53,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 19:30:53,753 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 130 [2018-02-02 19:30:53,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 108 treesize of output 117 [2018-02-02 19:30:53,880 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,935 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,939 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:53,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-02-02 19:30:53,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,943 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:53,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 83 [2018-02-02 19:30:53,945 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,960 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,963 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:53,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 100 [2018-02-02 19:30:53,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:53,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-02-02 19:30:53,969 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:53,984 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:54,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-02 19:30:54,042 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:171, output treesize:390 [2018-02-02 19:30:55,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 160 [2018-02-02 19:30:55,706 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:55,706 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 148 [2018-02-02 19:30:55,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:55,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:55,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 106 [2018-02-02 19:30:55,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:55,878 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:55,878 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2018-02-02 19:30:55,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:55,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:55,957 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:55,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 99 [2018-02-02 19:30:55,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:56,031 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 110 [2018-02-02 19:30:56,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,098 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 95 [2018-02-02 19:30:56,098 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,170 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:56,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2018-02-02 19:30:56,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:56,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,246 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:56,246 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:56,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 96 [2018-02-02 19:30:56,250 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:56,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 19:30:56,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 117 [2018-02-02 19:30:56,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-02-02 19:30:56,463 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,478 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-02 19:30:56,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,487 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2018-02-02 19:30:56,611 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:56,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 19:30:56,613 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:56,628 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:30:56,628 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,638 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:30:56,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 128 [2018-02-02 19:30:56,756 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 19:30:56,757 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 19:30:56,757 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:30:56,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2018-02-02 19:30:56,774 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,787 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:56,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 18 dim-0 vars, and 7 xjuncts. [2018-02-02 19:30:56,894 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:570, output treesize:551 [2018-02-02 19:30:57,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 48 [2018-02-02 19:30:57,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2018-02-02 19:30:57,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:57,291 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-02 19:30:57,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 19:30:57,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:57,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:30:57,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:5 [2018-02-02 19:30:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:30:57,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:30:57,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2018-02-02 19:30:57,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 19:30:57,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 19:30:57,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1961, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 19:30:57,370 INFO L87 Difference]: Start difference. First operand 457 states and 485 transitions. Second operand 46 states. [2018-02-02 19:31:36,333 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 133 DAG size of output 94 [2018-02-02 19:31:36,708 WARN L146 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 178 DAG size of output 149 Received shutdown request... [2018-02-02 19:31:40,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 19:31:40,923 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:31:40,928 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:31:40,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:31:40 BoogieIcfgContainer [2018-02-02 19:31:40,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:31:40,929 INFO L168 Benchmark]: Toolchain (without parser) took 87132.63 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 714.6 MB). Free memory was 358.8 MB in the beginning and 425.4 MB in the end (delta: -66.5 MB). Peak memory consumption was 648.1 MB. Max. memory is 5.3 GB. [2018-02-02 19:31:40,930 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:31:40,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.95 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 19:31:40,930 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:31:40,930 INFO L168 Benchmark]: RCFGBuilder took 620.53 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 272.1 MB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:31:40,930 INFO L168 Benchmark]: TraceAbstraction took 86286.96 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 714.6 MB). Free memory was 272.1 MB in the beginning and 425.4 MB in the end (delta: -153.3 MB). Peak memory consumption was 561.3 MB. Max. memory is 5.3 GB. [2018-02-02 19:31:40,931 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.95 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 345.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 620.53 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 272.1 MB in the end (delta: 70.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 86286.96 ms. Allocated memory was 402.1 MB in the beginning and 1.1 GB in the end (delta: 714.6 MB). Free memory was 272.1 MB in the beginning and 425.4 MB in the end (delta: -153.3 MB). Peak memory consumption was 561.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (457states) and interpolant automaton (currently 17 states, 46 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 315 locations, 109 error locations. TIMEOUT Result, 86.2s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 68.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8467 SDtfs, 7117 SDslu, 46648 SDs, 0 SdLazy, 27522 SolverSat, 1363 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 55.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1190 GetRequests, 547 SyntacticMatches, 64 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4353 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 763 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2214 NumberOfCodeBlocks, 2182 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2175 ConstructedInterpolants, 186 QuantifiedInterpolants, 4981428 SizeOfPredicates, 141 NumberOfNonLiveVariables, 1997 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 187/384 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-31-40-936.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-31-40-936.csv Completed graceful shutdown