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/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:55:55,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:55:55,849 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:55:55,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:55:55,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:55:55,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:55:55,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:55:55,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:55:55,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:55:55,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:55:55,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:55:55,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:55:55,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:55:55,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:55:55,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:55:55,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:55:55,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:55:55,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:55:55,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:55:55,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:55:55,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:55:55,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:55:55,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:55:55,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:55:55,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:55:55,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:55:55,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:55:55,892 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:55:55,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:55:55,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:55:55,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:55:55,893 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:55:55,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:55:55,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:55:55,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:55:55,903 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:55:55,903 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:55:55,903 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:55:55,903 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:55:55,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:55:55,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:55:55,904 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:55:55,904 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:55:55,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:55:55,906 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:55:55,906 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:55:55,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:55:55,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:55:55,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:55:55,906 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:55:55,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:55:55,907 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:55:55,908 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:55:55,908 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:55:55,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:55:55,908 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:55:55,909 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:55:55,909 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:55:55,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:55:55,952 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:55:55,955 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:55:55,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:55:55,957 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:55:55,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:55:56,137 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:55:56,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:55:56,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:55:56,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:55:56,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:55:56,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb98ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56, skipping insertion in model container [2018-01-23 14:55:56,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,164 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:55:56,202 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:55:56,326 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:55:56,350 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:55:56,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56 WrapperNode [2018-01-23 14:55:56,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:55:56,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:55:56,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:55:56,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:55:56,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... [2018-01-23 14:55:56,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:55:56,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:55:56,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:55:56,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:55:56,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (1/1) ... No working directory specified, using /storage/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-01-23 14:55:56,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:55:56,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:55:56,456 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:55:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:55:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:55:56,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:55:56,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:55:56,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:55:56,839 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:55:56,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:55:56 BoogieIcfgContainer [2018-01-23 14:55:56,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:55:56,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:55:56,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:55:56,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:55:56,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:55:56" (1/3) ... [2018-01-23 14:55:56,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec9e2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:55:56, skipping insertion in model container [2018-01-23 14:55:56,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:55:56" (2/3) ... [2018-01-23 14:55:56,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec9e2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:55:56, skipping insertion in model container [2018-01-23 14:55:56,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:55:56" (3/3) ... [2018-01-23 14:55:56,844 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-23 14:55:56,850 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:55:56,856 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:55:56,892 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:55:56,892 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:55:56,892 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:55:56,893 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:55:56,893 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:55:56,893 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:55:56,893 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:55:56,893 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:55:56,894 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:55:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-23 14:55:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:55:56,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:56,923 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:55:56,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:55:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash 258952, now seen corresponding path program 1 times [2018-01-23 14:55:56,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:56,931 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:56,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:56,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:56,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:55:57,052 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:55:57,058 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:55:57,064 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:55:57,065 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:55:57,065 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:55:57,065 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:55:57,065 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:55:57,065 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:55:57,065 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:55:57,065 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:55:57,065 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:55:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-23 14:55:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:55:57,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:57,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:57,070 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -806241979, now seen corresponding path program 1 times [2018-01-23 14:55:57,071 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:57,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:57,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:57,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:57,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:57,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:57,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:55:57,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:55:57,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:55:57,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:55:57,277 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-23 14:55:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:57,307 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-01-23 14:55:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:55:57,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-01-23 14:55:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:57,321 INFO L225 Difference]: With dead ends: 164 [2018-01-23 14:55:57,322 INFO L226 Difference]: Without dead ends: 91 [2018-01-23 14:55:57,325 INFO L525 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-01-23 14:55:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-23 14:55:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-23 14:55:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:55:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-23 14:55:57,357 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 30 [2018-01-23 14:55:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:57,358 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-23 14:55:57,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:55:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-23 14:55:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-23 14:55:57,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:57,359 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:55:57,359 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash -956225716, now seen corresponding path program 1 times [2018-01-23 14:55:57,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:57,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:57,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:57,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:57,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:57,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:55:57,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:55:57,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:55:57,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:55:57,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:55:57,482 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 5 states. [2018-01-23 14:55:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:55:57,642 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-23 14:55:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:55:57,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-23 14:55:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:55:57,645 INFO L225 Difference]: With dead ends: 153 [2018-01-23 14:55:57,645 INFO L226 Difference]: Without dead ends: 148 [2018-01-23 14:55:57,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-23 14:55:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-23 14:55:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2018-01-23 14:55:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-23 14:55:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-01-23 14:55:57,659 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 33 [2018-01-23 14:55:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:55:57,660 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-01-23 14:55:57,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:55:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-01-23 14:55:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:55:57,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:55:57,662 INFO L322 BasicCegarLoop]: trace histogram [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-01-23 14:55:57,662 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:55:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash -912780865, now seen corresponding path program 1 times [2018-01-23 14:55:57,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:55:57,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:55:57,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:57,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:55:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:57,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:55:58,325 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 47 DAG size of output 35 [2018-01-23 14:55:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:55:58,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:55:58,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:55:58,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:55:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:55:58,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:55:58,781 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-01-23 14:55:58,784 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-01-23 14:55:58,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-01-23 14:55:58,829 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 33 treesize of output 27 [2018-01-23 14:55:58,833 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 27 treesize of output 18 [2018-01-23 14:55:58,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:55:58,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-01-23 14:55:59,174 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~bucket~5.base Int) (|main_#t~malloc8.base| Int) (main_~bcki~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~bucket~5.base 1))) (let ((.cse1 (store .cse0 main_~bcki~5.base 1))) (and (= 0 (select .cse0 main_~bcki~5.base)) (= 0 (select .cse1 |main_#t~malloc8.base|)) (= |c_#valid| (store (store .cse1 |main_#t~malloc8.base| 1) main_~bucket~5.base 0)) (not (= 0 main_~bucket~5.base)))))) is different from true [2018-01-23 14:55:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:55:59,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:55:59,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-01-23 14:55:59,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:55:59,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:55:59,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=274, Unknown=3, NotChecked=34, Total=380 [2018-01-23 14:55:59,253 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 20 states. [2018-01-23 14:56:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:00,082 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-01-23 14:56:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-23 14:56:00,082 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-01-23 14:56:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:00,086 INFO L225 Difference]: With dead ends: 207 [2018-01-23 14:56:00,087 INFO L226 Difference]: Without dead ends: 202 [2018-01-23 14:56:00,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=136, Invalid=561, Unknown=9, NotChecked=50, Total=756 [2018-01-23 14:56:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-23 14:56:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 112. [2018-01-23 14:56:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-23 14:56:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-23 14:56:00,104 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 48 [2018-01-23 14:56:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:00,105 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-23 14:56:00,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:56:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-23 14:56:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:56:00,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:00,107 INFO L322 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] [2018-01-23 14:56:00,107 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash 773059570, now seen corresponding path program 1 times [2018-01-23 14:56:00,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:00,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:00,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:00,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:00,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:00,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:00,768 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 68 DAG size of output 43 [2018-01-23 14:56:00,946 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 75 DAG size of output 45 [2018-01-23 14:56:01,234 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 73 DAG size of output 45 [2018-01-23 14:56:01,399 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 63 DAG size of output 39 [2018-01-23 14:56:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:02,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:02,032 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:56:02,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:02,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:02,089 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-01-23 14:56:02,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:56:02,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,219 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 21 [2018-01-23 14:56:02,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-23 14:56:02,265 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-01-23 14:56:02,266 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 8 treesize of output 7 [2018-01-23 14:56:02,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-01-23 14:56:02,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,383 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 52 treesize of output 53 [2018-01-23 14:56:02,384 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 16 treesize of output 1 [2018-01-23 14:56:02,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-01-23 14:56:02,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,401 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 46 treesize of output 47 [2018-01-23 14:56:02,403 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-01-23 14:56:02,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-23 14:56:02,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:56:02,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-23 14:56:02,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,512 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 52 treesize of output 51 [2018-01-23 14:56:02,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,516 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 16 treesize of output 23 [2018-01-23 14:56:02,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-01-23 14:56:02,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,688 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2018-01-23 14:56:02,691 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 16 treesize of output 1 [2018-01-23 14:56:02,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,705 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-01-23 14:56:02,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:61 [2018-01-23 14:56:02,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,766 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-01-23 14:56:02,771 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-01-23 14:56:02,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,789 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-01-23 14:56:02,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-23 14:56:02,854 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 0 case distinctions, treesize of input 102 treesize of output 75 [2018-01-23 14:56:02,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:02,860 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 24 treesize of output 39 [2018-01-23 14:56:02,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:02,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:56:02,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-01-23 14:56:03,050 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 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-23 14:56:03,063 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2018-01-23 14:56:03,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:03,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:03,188 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 2 xjuncts. [2018-01-23 14:56:03,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:172 [2018-01-23 14:56:03,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-01-23 14:56:03,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,474 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 13 treesize of output 6 [2018-01-23 14:56:03,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,492 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 13 treesize of output 6 [2018-01-23 14:56:03,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,501 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,502 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 20 treesize of output 15 [2018-01-23 14:56:03,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 68 [2018-01-23 14:56:03,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-01-23 14:56:03,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:56:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,579 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 13 treesize of output 6 [2018-01-23 14:56:03,579 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-23 14:56:03,593 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:03,595 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 34 treesize of output 29 [2018-01-23 14:56:03,595 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:03,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:03,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:56:03,615 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:186, output treesize:28 [2018-01-23 14:56:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:03,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:03,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-01-23 14:56:03,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-23 14:56:03,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-23 14:56:03,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:56:03,780 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 39 states. [2018-01-23 14:56:04,309 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-23 14:56:04,500 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-01-23 14:56:04,700 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-01-23 14:56:05,081 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 92 DAG size of output 64 [2018-01-23 14:56:05,461 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 99 DAG size of output 73 [2018-01-23 14:56:05,667 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 122 DAG size of output 88 [2018-01-23 14:56:06,369 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-01-23 14:56:06,803 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 108 DAG size of output 108 [2018-01-23 14:56:07,147 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 99 DAG size of output 99 [2018-01-23 14:56:07,343 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 105 DAG size of output 105 [2018-01-23 14:56:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:09,064 INFO L93 Difference]: Finished difference Result 367 states and 398 transitions. [2018-01-23 14:56:09,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-23 14:56:09,065 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-01-23 14:56:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:09,068 INFO L225 Difference]: With dead ends: 367 [2018-01-23 14:56:09,068 INFO L226 Difference]: Without dead ends: 360 [2018-01-23 14:56:09,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=745, Invalid=5107, Unknown=0, NotChecked=0, Total=5852 [2018-01-23 14:56:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-23 14:56:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 137. [2018-01-23 14:56:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-23 14:56:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-01-23 14:56:09,093 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 58 [2018-01-23 14:56:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:09,094 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-01-23 14:56:09,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-23 14:56:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-01-23 14:56:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:56:09,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:09,096 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-23 14:56:09,096 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1697079073, now seen corresponding path program 2 times [2018-01-23 14:56:09,096 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:09,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:09,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:09,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:09,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:09,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:09,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:09,829 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:56:09,834 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:56:09,849 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:09,899 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:09,902 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:56:09,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:09,911 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-01-23 14:56:09,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:56:09,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:09,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:09,925 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-01-23 14:56:09,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-23 14:56:09,956 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-01-23 14:56:09,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, 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-01-23 14:56:09,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,967 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-01-23 14:56:09,968 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-01-23 14:56:09,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:09,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-01-23 14:56:10,001 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-01-23 14:56:10,003 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 7 [2018-01-23 14:56:10,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-23 14:56:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,066 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 44 treesize of output 45 [2018-01-23 14:56:10,068 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 16 treesize of output 1 [2018-01-23 14:56:10,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-23 14:56:10,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,086 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 38 treesize of output 39 [2018-01-23 14:56:10,088 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-01-23 14:56:10,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-23 14:56:10,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:56:10,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-01-23 14:56:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,184 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 52 [2018-01-23 14:56:10,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-01-23 14:56:10,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2018-01-23 14:56:10,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,320 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-01-23 14:56:10,323 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 16 treesize of output 1 [2018-01-23 14:56:10,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:60 [2018-01-23 14:56:10,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,380 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 90 [2018-01-23 14:56:10,382 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-01-23 14:56:10,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:69 [2018-01-23 14:56:10,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,484 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-01-23 14:56:10,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,500 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 24 treesize of output 39 [2018-01-23 14:56:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,589 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-01-23 14:56:10,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:89 [2018-01-23 14:56:10,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,796 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 0 case distinctions, treesize of input 99 treesize of output 97 [2018-01-23 14:56:10,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:10,903 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 146 [2018-01-23 14:56:10,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:10,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:10,978 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-01-23 14:56:10,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:98 [2018-01-23 14:56:11,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:11,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:11,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2018-01-23 14:56:11,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:11,310 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 95 [2018-01-23 14:56:11,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-23 14:56:11,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-23 14:56:11,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-01-23 14:56:11,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:553 [2018-01-23 14:56:21,800 WARN L146 SmtUtils]: Spent 10127ms on a formula simplification. DAG size of input: 177 DAG size of output 69 [2018-01-23 14:56:21,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-01-23 14:56:21,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,933 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:56:21,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:21,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,946 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 13 treesize of output 6 [2018-01-23 14:56:21,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:21,953 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 18 treesize of output 9 [2018-01-23 14:56:21,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:21,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:21,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,978 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 90 [2018-01-23 14:56:21,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,980 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 13 treesize of output 6 [2018-01-23 14:56:21,980 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:21,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:21,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2018-01-23 14:56:21,999 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-23 14:56:22,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:22,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-01-23 14:56:22,022 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 5 xjuncts. [2018-01-23 14:56:22,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:56:22,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-23 14:56:22,077 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:239, output treesize:50 [2018-01-23 14:56:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:56:22,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:22,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-01-23 14:56:22,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-23 14:56:22,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-23 14:56:22,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1507, Unknown=0, NotChecked=0, Total=1640 [2018-01-23 14:56:22,218 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 41 states. [2018-01-23 14:56:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:24,894 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2018-01-23 14:56:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-23 14:56:24,894 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 73 [2018-01-23 14:56:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:24,896 INFO L225 Difference]: With dead ends: 234 [2018-01-23 14:56:24,896 INFO L226 Difference]: Without dead ends: 229 [2018-01-23 14:56:24,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=494, Invalid=3666, Unknown=0, NotChecked=0, Total=4160 [2018-01-23 14:56:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-23 14:56:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 143. [2018-01-23 14:56:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-23 14:56:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-23 14:56:24,922 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 73 [2018-01-23 14:56:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:24,922 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-23 14:56:24,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-23 14:56:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-23 14:56:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:56:24,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:24,924 INFO L322 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] [2018-01-23 14:56:24,925 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2011199221, now seen corresponding path program 1 times [2018-01-23 14:56:24,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:24,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:24,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:24,926 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:56:24,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:24,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:25,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:25,799 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:56:25,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:25,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:26,030 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 11 treesize of output 8 [2018-01-23 14:56:26,032 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-01-23 14:56:26,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:26,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:26,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:26,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-23 14:56:26,118 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 18 treesize of output 14 [2018-01-23 14:56:26,125 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 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-23 14:56:26,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:56:26,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:26,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:26,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-01-23 14:56:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:26,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:26,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-23 14:56:26,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-23 14:56:26,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-23 14:56:26,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-01-23 14:56:26,275 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 28 states. [2018-01-23 14:56:26,937 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-23 14:56:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:29,042 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2018-01-23 14:56:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:56:29,066 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-01-23 14:56:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:29,067 INFO L225 Difference]: With dead ends: 359 [2018-01-23 14:56:29,068 INFO L226 Difference]: Without dead ends: 329 [2018-01-23 14:56:29,069 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=681, Invalid=2979, Unknown=0, NotChecked=0, Total=3660 [2018-01-23 14:56:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-23 14:56:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 171. [2018-01-23 14:56:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-23 14:56:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-01-23 14:56:29,087 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 74 [2018-01-23 14:56:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:29,088 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-01-23 14:56:29,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-23 14:56:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-01-23 14:56:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-23 14:56:29,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:29,089 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:56:29,089 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:56:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 894038559, now seen corresponding path program 2 times [2018-01-23 14:56:29,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:29,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:29,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:29,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:56:29,180 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:56:29,194 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:29,209 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:29,209 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:56:29,246 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:56:29,246 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:56:29,246 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:56:29,246 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:56:29,246 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:56:29,246 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:56:29,246 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:56:29,246 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:56:29,247 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:56:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-23 14:56:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:56:29,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:29,252 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:56:29,252 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1183517258, now seen corresponding path program 1 times [2018-01-23 14:56:29,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:29,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:29,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:29,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:29,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:29,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:29,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:56:29,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:56:29,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:56:29,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:56:29,273 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-23 14:56:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:29,277 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-01-23 14:56:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:56:29,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-23 14:56:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:29,278 INFO L225 Difference]: With dead ends: 164 [2018-01-23 14:56:29,278 INFO L226 Difference]: Without dead ends: 89 [2018-01-23 14:56:29,279 INFO L525 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-01-23 14:56:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-23 14:56:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-23 14:56:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:56:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-23 14:56:29,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 28 [2018-01-23 14:56:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:29,284 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-23 14:56:29,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:56:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-23 14:56:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-23 14:56:29,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:29,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:56:29,285 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1931719151, now seen corresponding path program 1 times [2018-01-23 14:56:29,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:29,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:29,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:29,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:29,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:29,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:56:29,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:56:29,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:56:29,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:56:29,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:56:29,345 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 5 states. [2018-01-23 14:56:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:29,481 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2018-01-23 14:56:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:56:29,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-23 14:56:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:29,482 INFO L225 Difference]: With dead ends: 149 [2018-01-23 14:56:29,482 INFO L226 Difference]: Without dead ends: 146 [2018-01-23 14:56:29,483 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-01-23 14:56:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-23 14:56:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2018-01-23 14:56:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-23 14:56:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-23 14:56:29,488 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 31 [2018-01-23 14:56:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:29,488 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-23 14:56:29,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:56:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-23 14:56:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:56:29,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:29,489 INFO L322 BasicCegarLoop]: trace histogram [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-01-23 14:56:29,489 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash 83966276, now seen corresponding path program 1 times [2018-01-23 14:56:29,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:29,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:29,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:29,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:29,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:30,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:30,044 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:56:30,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:30,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:30,084 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-01-23 14:56:30,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:56:30,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,101 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 21 [2018-01-23 14:56:30,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-23 14:56:30,128 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-01-23 14:56:30,129 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 8 treesize of output 7 [2018-01-23 14:56:30,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-01-23 14:56:30,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,194 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 52 treesize of output 53 [2018-01-23 14:56:30,196 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 16 treesize of output 1 [2018-01-23 14:56:30,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-01-23 14:56:30,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,212 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 46 treesize of output 47 [2018-01-23 14:56:30,213 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-01-23 14:56:30,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-23 14:56:30,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:56:30,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-23 14:56:30,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,290 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 52 treesize of output 51 [2018-01-23 14:56:30,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,292 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 16 treesize of output 23 [2018-01-23 14:56:30,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-01-23 14:56:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2018-01-23 14:56:30,400 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 16 treesize of output 1 [2018-01-23 14:56:30,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,415 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-01-23 14:56:30,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:61 [2018-01-23 14:56:30,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,445 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-01-23 14:56:30,447 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-01-23 14:56:30,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,465 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-01-23 14:56:30,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-23 14:56:30,503 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 0 case distinctions, treesize of input 102 treesize of output 75 [2018-01-23 14:56:30,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,510 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 24 treesize of output 39 [2018-01-23 14:56:30,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:56:30,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-01-23 14:56:30,660 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 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-23 14:56:30,668 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2018-01-23 14:56:30,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:30,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:30,717 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 2 xjuncts. [2018-01-23 14:56:30,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:172 [2018-01-23 14:56:30,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-01-23 14:56:30,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,877 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 13 treesize of output 6 [2018-01-23 14:56:30,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,889 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 13 treesize of output 6 [2018-01-23 14:56:30,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,898 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 20 treesize of output 15 [2018-01-23 14:56:30,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 68 [2018-01-23 14:56:30,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,928 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 13 treesize of output 6 [2018-01-23 14:56:30,928 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-01-23 14:56:30,948 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-23 14:56:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-23 14:56:30,971 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:30,974 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 34 treesize of output 29 [2018-01-23 14:56:30,974 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:30,982 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:56:30,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:56:30,993 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:186, output treesize:28 [2018-01-23 14:56:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:31,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:31,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 32 [2018-01-23 14:56:31,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-23 14:56:31,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-23 14:56:31,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-01-23 14:56:31,085 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 32 states. [2018-01-23 14:56:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:33,348 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-01-23 14:56:33,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:56:33,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-01-23 14:56:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:33,349 INFO L225 Difference]: With dead ends: 182 [2018-01-23 14:56:33,349 INFO L226 Difference]: Without dead ends: 179 [2018-01-23 14:56:33,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=369, Invalid=2283, Unknown=0, NotChecked=0, Total=2652 [2018-01-23 14:56:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-23 14:56:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2018-01-23 14:56:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-23 14:56:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-23 14:56:33,358 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-01-23 14:56:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:33,358 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-23 14:56:33,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-23 14:56:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-23 14:56:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-23 14:56:33,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:33,360 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:56:33,360 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1760026191, now seen corresponding path program 2 times [2018-01-23 14:56:33,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:33,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:33,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:33,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:56:33,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:33,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:34,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:56:34,143 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:56:34,149 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:56:34,162 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:34,208 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:56:34,211 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:56:34,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:56:34,218 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-01-23 14:56:34,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:56:34,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,230 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-01-23 14:56:34,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-23 14:56:34,261 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-01-23 14:56:34,263 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-01-23 14:56:34,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,274 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-01-23 14:56:34,276 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-01-23 14:56:34,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-01-23 14:56:34,310 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-01-23 14:56:34,311 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 7 [2018-01-23 14:56:34,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-23 14:56:34,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,376 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 44 treesize of output 45 [2018-01-23 14:56:34,378 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 16 treesize of output 1 [2018-01-23 14:56:34,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-23 14:56:34,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,394 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 38 treesize of output 39 [2018-01-23 14:56:34,396 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-01-23 14:56:34,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-23 14:56:34,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:56:34,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-01-23 14:56:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,487 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 52 [2018-01-23 14:56:34,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-01-23 14:56:34,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2018-01-23 14:56:34,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,618 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-01-23 14:56:34,620 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 16 treesize of output 1 [2018-01-23 14:56:34,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:60 [2018-01-23 14:56:34,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 90 [2018-01-23 14:56:34,671 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-01-23 14:56:34,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:69 [2018-01-23 14:56:34,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,736 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-01-23 14:56:34,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,739 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 24 treesize of output 39 [2018-01-23 14:56:34,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,761 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-01-23 14:56:34,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:89 [2018-01-23 14:56:34,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,856 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 0 case distinctions, treesize of input 99 treesize of output 97 [2018-01-23 14:56:34,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:34,868 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 146 [2018-01-23 14:56:34,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:56:34,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:34,901 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-01-23 14:56:34,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:98 [2018-01-23 14:56:35,035 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:35,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:35,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 89 [2018-01-23 14:56:35,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:35,069 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2018-01-23 14:56:35,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-23 14:56:35,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-23 14:56:35,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-01-23 14:56:35,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:529 [2018-01-23 14:56:45,491 WARN L146 SmtUtils]: Spent 10086ms on a formula simplification. DAG size of input: 176 DAG size of output 67 [2018-01-23 14:56:45,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,584 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 90 [2018-01-23 14:56:45,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,621 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 114 [2018-01-23 14:56:45,621 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-23 14:56:45,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 33 dim-0 vars, End of recursive call: 33 dim-0 vars, and 38 xjuncts. [2018-01-23 14:56:45,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,847 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 13 treesize of output 6 [2018-01-23 14:56:45,847 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:45,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:56:45,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:45,889 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 52 treesize of output 49 [2018-01-23 14:56:45,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-23 14:56:45,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-23 14:56:45,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:45,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:56:45,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-01-23 14:56:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,970 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:56:45,971 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:45,988 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 18 treesize of output 9 [2018-01-23 14:56:45,988 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:45,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:56:45,996 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 13 treesize of output 6 [2018-01-23 14:56:45,996 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:56:46,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:56:46,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-23 14:56:46,036 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:239, output treesize:50 [2018-01-23 14:56:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:56:46,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:56:46,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-01-23 14:56:46,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-23 14:56:46,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-23 14:56:46,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1509, Unknown=0, NotChecked=0, Total=1640 [2018-01-23 14:56:46,163 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 41 states. [2018-01-23 14:56:47,309 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 95 DAG size of output 78 [2018-01-23 14:56:47,525 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-23 14:56:47,869 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 104 DAG size of output 87 [2018-01-23 14:56:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:56:48,668 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-01-23 14:56:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-23 14:56:48,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-01-23 14:56:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:56:48,669 INFO L225 Difference]: With dead ends: 253 [2018-01-23 14:56:48,669 INFO L226 Difference]: Without dead ends: 250 [2018-01-23 14:56:48,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=520, Invalid=3770, Unknown=0, NotChecked=0, Total=4290 [2018-01-23 14:56:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-23 14:56:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 141. [2018-01-23 14:56:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-23 14:56:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-23 14:56:48,679 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 61 [2018-01-23 14:56:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:56:48,679 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-23 14:56:48,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-23 14:56:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-23 14:56:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-23 14:56:48,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:56:48,680 INFO L322 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] [2018-01-23 14:56:48,680 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:56:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2057956464, now seen corresponding path program 1 times [2018-01-23 14:56:48,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:56:48,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:56:48,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:48,681 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:56:48,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:56:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:56:48,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:56:48,794 ERROR L119 erpolLogProxyWrapper]: Interpolant 48 not inductive: (Check returned sat) [2018-01-23 14:56:48,801 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-23 14:56:48,804 INFO L168 Benchmark]: Toolchain (without parser) took 52666.41 ms. Allocated memory was 308.8 MB in the beginning and 733.5 MB in the end (delta: 424.7 MB). Free memory was 267.7 MB in the beginning and 410.7 MB in the end (delta: -142.9 MB). Peak memory consumption was 281.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:48,805 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:56:48,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.24 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:48,806 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:48,806 INFO L168 Benchmark]: RCFGBuilder took 438.08 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 222.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:48,806 INFO L168 Benchmark]: TraceAbstraction took 51963.37 ms. Allocated memory was 308.8 MB in the beginning and 733.5 MB in the end (delta: 424.7 MB). Free memory was 222.9 MB in the beginning and 410.7 MB in the end (delta: -187.8 MB). Peak memory consumption was 236.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:56:48,808 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.14 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.24 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 255.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 438.08 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 222.9 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51963.37 ms. Allocated memory was 308.8 MB in the beginning and 733.5 MB in the end (delta: 424.7 MB). Free memory was 222.9 MB in the beginning and 410.7 MB in the end (delta: -187.8 MB). Peak memory consumption was 236.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 94 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L993] EXPR, FCALL malloc(sizeof(BCK)) VAL [malloc(sizeof(BCK))={18:0}] [L993] BCK* bucket = malloc(sizeof(BCK)); VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L994] FCALL bucket->data = 0 VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L995] FCALL bucket->list = ((void*)0) VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L997] EXPR, FCALL malloc(sizeof(BCK)) VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}] [L997] FCALL bucket->next = malloc(sizeof(BCK)) VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}] [L998] EXPR, FCALL bucket->next VAL [bucket={18:0}, bucket->next={31:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}] [L998] BCK* bcki = bucket->next; [L999] FCALL bcki->data = 1 VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}] [L1000] FCALL bcki->list = ((void*)0) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}] [L1002] EXPR, FCALL malloc(sizeof(BCK)) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1002] FCALL bcki->next = malloc(sizeof(BCK)) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1003] EXPR, FCALL bcki->next VAL [bcki={31:0}, bcki->next={19:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1003] bcki = bcki->next [L1004] FCALL bcki->data = 2 VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1005] FCALL bcki->list = ((void*)0) VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1006] FCALL bcki->next = ((void*)0) VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1008] struct TSLL* item = ((void*)0); [L1009] struct TSLL* itr = ((void*)0); VAL [bcki={19:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1041] bcki = bucket VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={18:0}, bcki->list={0:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1054] bucket = bcki VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={18:0}, bcki->next={31:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={31:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1057] bucket = ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={31:0}, bcki->list={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1054] bucket = bcki VAL [bcki={31:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={31:0}, bcki->next={19:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={19:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1057] bucket = ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={19:0}, bcki->list={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1053] COND FALSE !(0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1054] bucket = bcki VAL [bcki={19:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={19:0}, bcki->next={0:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={0:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1057] bucket = ((void*)0) VAL [bcki={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1042] COND FALSE !(bcki != ((void*)0)) VAL [bcki={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={19:0}] [L1060] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 94 locations, 3 error locations. UNSAFE Result, 32.1s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 2932 SDslu, 6268 SDs, 0 SdLazy, 4467 SolverSat, 378 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 207 SyntacticMatches, 12 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=6, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 612 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 559 ConstructedInterpolants, 106 QuantifiedInterpolants, 1482554 SizeOfPredicates, 56 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 8/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-56-48-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-56-48-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-56-48-817.csv Received shutdown request...