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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:05:46,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:05:46,974 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:05:46,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:05:46,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:05:46,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:05:46,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:05:46,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:05:46,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:05:46,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:05:46,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:05:46,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:05:46,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:05:46,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:05:46,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:05:47,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:05:47,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:05:47,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:05:47,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:05:47,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:05:47,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:05:47,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:05:47,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:05:47,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:05:47,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:05:47,018 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:05:47,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:05:47,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:05:47,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:05:47,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:05:47,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:05:47,021 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:05:47,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:05:47,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:05:47,033 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:05:47,033 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:05:47,033 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:05:47,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:05:47,033 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:05:47,034 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:05:47,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:05:47,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:05:47,035 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:05:47,035 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:05:47,035 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:05:47,035 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:05:47,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:05:47,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:05:47,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:05:47,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:05:47,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:05:47,037 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:05:47,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:05:47,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:05:47,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:05:47,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:05:47,039 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:05:47,040 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:05:47,040 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:05:47,041 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:05:47,041 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:05:47,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:05:47,089 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:05:47,093 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:05:47,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:05:47,096 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:05:47,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-21 10:05:47,295 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:05:47,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:05:47,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:05:47,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:05:47,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:05:47,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,333 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:05:47,374 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:05:47,499 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:05:47,514 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:05:47,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47 WrapperNode [2018-01-21 10:05:47,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:05:47,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:05:47,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:05:47,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:05:47,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (1/1) ... [2018-01-21 10:05:47,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:05:47,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:05:47,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:05:47,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:05:47,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (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-21 10:05:47,606 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:05:47,606 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:05:47,606 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:05:47,606 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:05:47,606 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:05:47,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:05:47,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:05:47,825 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:05:47,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:05:47 BoogieIcfgContainer [2018-01-21 10:05:47,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:05:47,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:05:47,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:05:47,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:05:47,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:05:47" (1/3) ... [2018-01-21 10:05:47,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382facc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:05:47" (2/3) ... [2018-01-21 10:05:47,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382facc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:05:47, skipping insertion in model container [2018-01-21 10:05:47,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:05:47" (3/3) ... [2018-01-21 10:05:47,832 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_alloca_unsafe_false-valid-deref.i [2018-01-21 10:05:47,839 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:05:47,845 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:05:47,882 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:05:47,882 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:05:47,883 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:05:47,883 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:05:47,883 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:05:47,883 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:05:47,883 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:05:47,883 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:05:47,884 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:05:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:05:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:05:47,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:47,913 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:05:47,913 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:05:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-21 10:05:47,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:47,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:47,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:47,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:47,968 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:05:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:05:48,021 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:05:48,027 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:05:48,032 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:05:48,033 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:05:48,033 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:05:48,033 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:05:48,033 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:05:48,033 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:05:48,033 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:05:48,033 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:05:48,033 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:05:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:05:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:05:48,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,036 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] [2018-01-21 10:05:48,036 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-21 10:05:48,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,177 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-21 10:05:48,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:05:48,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:05:48,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:05:48,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:05:48,261 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 10:05:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,279 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 10:05:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:05:48,281 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 10:05:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,293 INFO L225 Difference]: With dead ends: 70 [2018-01-21 10:05:48,293 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 10:05:48,297 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-21 10:05:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 10:05:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-21 10:05:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 10:05:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-21 10:05:48,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-21 10:05:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,338 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-21 10:05:48,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:05:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-21 10:05:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:05:48,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,339 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] [2018-01-21 10:05:48,339 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-21 10:05:48,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,489 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-21 10:05:48,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:05:48,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:05:48,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:05:48,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:05:48,491 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-21 10:05:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,533 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 10:05:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:05:48,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 10:05:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,539 INFO L225 Difference]: With dead ends: 109 [2018-01-21 10:05:48,539 INFO L226 Difference]: Without dead ends: 75 [2018-01-21 10:05:48,540 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:05:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-21 10:05:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-21 10:05:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:05:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 10:05:48,548 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-21 10:05:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,548 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 10:05:48,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:05:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 10:05:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:05:48,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,550 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] [2018-01-21 10:05:48,550 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-21 10:05:48,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:48,627 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-21 10:05:48,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:48,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:05:48,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:48,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:05:48,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:05:48,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:05:48,629 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 10:05:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:48,692 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-21 10:05:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:05:48,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 10:05:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:48,695 INFO L225 Difference]: With dead ends: 75 [2018-01-21 10:05:48,695 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 10:05:48,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:05:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 10:05:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-21 10:05:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 10:05:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-21 10:05:48,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-21 10:05:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:48,703 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-21 10:05:48,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:05:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-21 10:05:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:05:48,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:48,704 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] [2018-01-21 10:05:48,704 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-21 10:05:48,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:48,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:48,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:48,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:48,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:49,155 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 64 DAG size of output 32 [2018-01-21 10:05:49,389 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-21 10:05:49,563 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 71 DAG size of output 39 [2018-01-21 10:05:49,794 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 62 DAG size of output 36 [2018-01-21 10:05:49,947 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 59 DAG size of output 29 [2018-01-21 10:05:50,002 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-21 10:05:50,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:50,003 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:50,004 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-21 10:05:50,006 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 10:05:50,068 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:50,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:05:52,783 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:05:52,784 INFO L268 AbstractInterpreter]: Visited 29 different actions 47 times. Merged at 17 different actions 17 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-21 10:05:52,818 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:05:52,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:52,818 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:05:52,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:52,829 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:52,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:53,043 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 34 treesize of output 29 [2018-01-21 10:05:53,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:53,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 10:05:53,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,067 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 35 treesize of output 30 [2018-01-21 10:05:53,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:53,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 10:05:53,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 10:05:53,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-21 10:05:53,238 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 30 treesize of output 24 [2018-01-21 10:05:53,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-21 10:05:53,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-21 10:05:53,269 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-21 10:05:53,270 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:53,450 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 36 treesize of output 32 [2018-01-21 10:05:53,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2018-01-21 10:05:53,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,471 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 16 treesize of output 11 [2018-01-21 10:05:53,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:53,491 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 35 treesize of output 31 [2018-01-21 10:05:53,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2018-01-21 10:05:53,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,510 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 16 treesize of output 11 [2018-01-21 10:05:53,510 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:53,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:53,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-21 10:05:53,549 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:72, output treesize:41 [2018-01-21 10:05:53,621 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-21 10:05:53,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:53,647 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:05:54,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:54,192 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:54,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:54,339 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:05:54,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,360 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 27 treesize of output 22 [2018-01-21 10:05:54,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:54,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 10:05:54,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 10:05:54,375 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:118, output treesize:29 [2018-01-21 10:05:54,441 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 29 treesize of output 23 [2018-01-21 10:05:54,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-01-21 10:05:54,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:4 [2018-01-21 10:05:54,486 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-21 10:05:54,487 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:54,514 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 36 treesize of output 32 [2018-01-21 10:05:54,529 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 16 treesize of output 11 [2018-01-21 10:05:54,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2018-01-21 10:05:54,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:54,549 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 35 treesize of output 31 [2018-01-21 10:05:54,564 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 16 treesize of output 11 [2018-01-21 10:05:54,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 14 [2018-01-21 10:05:54,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:54,570 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:54,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:05:54,580 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2018-01-21 10:05:54,604 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-21 10:05:54,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:05:54,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 11, 10] total 27 [2018-01-21 10:05:54,606 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:05:54,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 10:05:54,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 10:05:54,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-01-21 10:05:54,608 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 17 states. [2018-01-21 10:05:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:55,282 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-21 10:05:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:05:55,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-01-21 10:05:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:55,284 INFO L225 Difference]: With dead ends: 102 [2018-01-21 10:05:55,284 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 10:05:55,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-01-21 10:05:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 10:05:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-21 10:05:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 10:05:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-21 10:05:55,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-21 10:05:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:55,293 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-21 10:05:55,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-21 10:05:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-21 10:05:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:55,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:55,294 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] [2018-01-21 10:05:55,294 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-21 10:05:55,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:55,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:55,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:55,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:55,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:55,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:05:55,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:05:55,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-21 10:05:55,486 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:05:55,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:05:55,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:05:55,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-21 10:05:55,487 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-21 10:05:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:55,682 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-21 10:05:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 10:05:55,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-21 10:05:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:55,684 INFO L225 Difference]: With dead ends: 128 [2018-01-21 10:05:55,684 INFO L226 Difference]: Without dead ends: 121 [2018-01-21 10:05:55,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-21 10:05:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-21 10:05:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-21 10:05:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 10:05:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-21 10:05:55,691 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-21 10:05:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:55,691 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-21 10:05:55,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:05:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-21 10:05:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:55,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:55,693 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] [2018-01-21 10:05:55,693 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-21 10:05:55,693 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:55,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:55,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:55,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:55,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:55,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:55,741 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-21 10:05:55,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:55,741 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:55,741 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 10:05:55,742 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [16], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 10:05:55,743 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:55,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:05:57,548 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:05:57,549 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-01-21 10:05:57,554 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:05:57,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:57,554 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:05:57,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:57,574 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:57,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:57,630 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-21 10:05:57,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:57,665 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-21 10:05:57,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:57,685 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:05:57,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:57,688 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:57,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:57,715 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-21 10:05:57,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:57,754 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-21 10:05:57,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:05:57,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-21 10:05:57,756 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:05:57,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:05:57,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:05:57,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-21 10:05:57,757 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-21 10:05:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:05:57,849 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-21 10:05:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 10:05:57,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-21 10:05:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:05:57,850 INFO L225 Difference]: With dead ends: 185 [2018-01-21 10:05:57,850 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 10:05:57,851 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-21 10:05:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 10:05:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-21 10:05:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 10:05:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-21 10:05:57,862 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-21 10:05:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:05:57,862 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-21 10:05:57,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:05:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-21 10:05:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:05:57,863 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:05:57,863 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] [2018-01-21 10:05:57,863 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:05:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-21 10:05:57,863 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:05:57,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:57,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:57,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:05:57,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:05:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:57,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:05:58,131 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-21 10:05:58,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:58,131 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:05:58,131 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-21 10:05:58,131 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [12], [18], [20], [21], [25], [28], [30], [31], [40], [42], [46], [47], [51], [53], [54], [57], [58], [59], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 10:05:58,133 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:05:58,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:05:59,603 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:05:59,603 INFO L268 AbstractInterpreter]: Visited 31 different actions 51 times. Merged at 19 different actions 19 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-21 10:05:59,608 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:05:59,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:05:59,608 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 10:05:59,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:05:59,613 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:05:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:05:59,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:05:59,690 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:05:59,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-21 10:05:59,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:59,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-21 10:05:59,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,721 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-21 10:05:59,769 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 33 treesize of output 27 [2018-01-21 10:05:59,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:05:59,785 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:05:59,786 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 27 treesize of output 26 [2018-01-21 10:05:59,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 10:05:59,807 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-21 10:05:59,807 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:05:59,956 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 35 treesize of output 31 [2018-01-21 10:05:59,973 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 21 treesize of output 16 [2018-01-21 10:05:59,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 16 [2018-01-21 10:05:59,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:05:59,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:05:59,983 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-21 10:05:59,983 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2018-01-21 10:06:00,011 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-21 10:06:00,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:00,032 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:06:00,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:00,035 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:00,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:00,110 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:06:00,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,125 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 18 treesize of output 15 [2018-01-21 10:06:00,126 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 15 treesize of output 14 [2018-01-21 10:06:00,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,133 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:24 [2018-01-21 10:06:00,306 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 33 treesize of output 27 [2018-01-21 10:06:00,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:00,311 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:00,311 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 27 treesize of output 26 [2018-01-21 10:06:00,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-21 10:06:00,336 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-21 10:06:00,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:00,482 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 61 treesize of output 55 [2018-01-21 10:06:00,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-01-21 10:06:00,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,507 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 17 treesize of output 12 [2018-01-21 10:06:00,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,513 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 64 treesize of output 58 [2018-01-21 10:06:00,537 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 17 treesize of output 12 [2018-01-21 10:06:00,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-01-21 10:06:00,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,584 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 58 treesize of output 52 [2018-01-21 10:06:00,607 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 17 treesize of output 12 [2018-01-21 10:06:00,607 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-01-21 10:06:00,608 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,614 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,635 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 46 treesize of output 42 [2018-01-21 10:06:00,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-01-21 10:06:00,655 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,657 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 17 treesize of output 12 [2018-01-21 10:06:00,657 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,663 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,681 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 47 treesize of output 43 [2018-01-21 10:06:00,701 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 17 treesize of output 12 [2018-01-21 10:06:00,701 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2018-01-21 10:06:00,702 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,706 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:00,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:00,724 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 5 variables, input treesize:434, output treesize:40 [2018-01-21 10:06:00,865 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-21 10:06:00,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:00,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 39 [2018-01-21 10:06:00,868 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:00,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-21 10:06:00,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-21 10:06:00,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2018-01-21 10:06:00,869 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-21 10:06:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:01,632 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-21 10:06:01,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-21 10:06:01,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-21 10:06:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:01,633 INFO L225 Difference]: With dead ends: 234 [2018-01-21 10:06:01,633 INFO L226 Difference]: Without dead ends: 227 [2018-01-21 10:06:01,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=696, Invalid=2964, Unknown=0, NotChecked=0, Total=3660 [2018-01-21 10:06:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-21 10:06:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-21 10:06:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-21 10:06:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-21 10:06:01,647 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-21 10:06:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:01,647 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-21 10:06:01,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-21 10:06:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-21 10:06:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:06:01,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:01,650 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] [2018-01-21 10:06:01,650 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-21 10:06:01,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:01,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:01,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:01,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:01,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:01,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:01,972 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 65 DAG size of output 38 [2018-01-21 10:06:02,756 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-21 10:06:02,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:02,756 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:02,756 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-21 10:06:02,756 INFO L201 CegarAbsIntRunner]: [0], [1], [6], [7], [10], [18], [20], [21], [25], [28], [30], [31], [34], [35], [36], [37], [38], [42], [46], [47], [51], [53], [54], [61], [65], [78], [79], [80], [81], [83], [84], [85], [86] [2018-01-21 10:06:02,758 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:06:02,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:06:05,460 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:06:05,460 INFO L268 AbstractInterpreter]: Visited 33 different actions 77 times. Merged at 21 different actions 42 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-21 10:06:05,463 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:06:05,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:05,463 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:06:05,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:05,468 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:05,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:05,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:05,591 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 28 treesize of output 29 [2018-01-21 10:06:05,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-21 10:06:05,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,602 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-21 10:06:05,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-21 10:06:05,645 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 10:06:05,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,661 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 26 treesize of output 21 [2018-01-21 10:06:05,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:05,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:05,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-21 10:06:05,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 10:06:05,704 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-21 10:06:05,751 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 29 treesize of output 23 [2018-01-21 10:06:05,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:05,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:05,755 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 23 treesize of output 22 [2018-01-21 10:06:05,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:05,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-21 10:06:05,777 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-21 10:06:05,777 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:06,100 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 54 treesize of output 48 [2018-01-21 10:06:06,102 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,102 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-21 10:06:06,110 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 23 treesize of output 10 [2018-01-21 10:06:06,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,113 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,113 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,114 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 18 treesize of output 16 [2018-01-21 10:06:06,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:06,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:06,145 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 55 treesize of output 49 [2018-01-21 10:06:06,148 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,148 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-01-21 10:06:06,159 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 23 treesize of output 10 [2018-01-21 10:06:06,159 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,160 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:06,161 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 18 treesize of output 16 [2018-01-21 10:06:06,162 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:06,173 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:06,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-21 10:06:06,190 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:110, output treesize:61 [2018-01-21 10:06:06,276 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-21 10:06:06,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:06,297 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:06:06,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:06,301 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:06:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:06,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:06,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,542 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 25 treesize of output 28 [2018-01-21 10:06:06,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,545 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 28 treesize of output 19 [2018-01-21 10:06:06,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-01-21 10:06:06,583 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 38 treesize of output 33 [2018-01-21 10:06:06,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 43 [2018-01-21 10:06:06,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,598 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 39 treesize of output 34 [2018-01-21 10:06:06,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 43 [2018-01-21 10:06:06,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 10:06:06,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:30 [2018-01-21 10:06:06,707 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 28 treesize of output 22 [2018-01-21 10:06:06,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 10:06:06,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-21 10:06:06,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 10:06:06,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2018-01-21 10:06:06,765 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-21 10:06:06,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:07,057 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 53 treesize of output 47 [2018-01-21 10:06:07,061 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-21 10:06:07,079 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 21 treesize of output 10 [2018-01-21 10:06:07,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:07,080 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,081 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-21 10:06:07,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:07,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:07,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:07,106 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 54 treesize of output 48 [2018-01-21 10:06:07,110 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-01-21 10:06:07,124 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 21 treesize of output 10 [2018-01-21 10:06:07,125 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:07,126 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,126 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 10:06:07,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-21 10:06:07,127 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 10:06:07,130 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:07,135 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 10:06:07,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 10:06:07,146 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:41 [2018-01-21 10:06:07,181 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-21 10:06:07,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:07,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13, 14, 13] total 51 [2018-01-21 10:06:07,183 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:07,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-21 10:06:07,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-21 10:06:07,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2018-01-21 10:06:07,185 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 26 states. [2018-01-21 10:06:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:09,041 INFO L93 Difference]: Finished difference Result 250 states and 281 transitions. [2018-01-21 10:06:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-21 10:06:09,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-01-21 10:06:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:09,042 INFO L225 Difference]: With dead ends: 250 [2018-01-21 10:06:09,043 INFO L226 Difference]: Without dead ends: 220 [2018-01-21 10:06:09,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1046, Invalid=5926, Unknown=0, NotChecked=0, Total=6972 [2018-01-21 10:06:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-21 10:06:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 109. [2018-01-21 10:06:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-21 10:06:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-21 10:06:09,053 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 34 [2018-01-21 10:06:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:09,053 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-21 10:06:09,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-21 10:06:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-21 10:06:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:06:09,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:09,054 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-21 10:06:09,055 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-21 10:06:09,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:09,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:09,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:09,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:09,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:09,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,120 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:09,120 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:06:09,120 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:06:09,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,121 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:06:09,128 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:09,128 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:09,139 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,142 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,143 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:09,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,254 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:06:09,257 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:09,257 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:09,268 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,279 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,291 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:09,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,331 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:09,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-21 10:06:09,363 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:09,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-21 10:06:09,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-21 10:06:09,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-01-21 10:06:09,364 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 11 states. [2018-01-21 10:06:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:09,439 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2018-01-21 10:06:09,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:06:09,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-21 10:06:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:09,440 INFO L225 Difference]: With dead ends: 201 [2018-01-21 10:06:09,440 INFO L226 Difference]: Without dead ends: 172 [2018-01-21 10:06:09,441 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:06:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-21 10:06:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-01-21 10:06:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-21 10:06:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-01-21 10:06:09,449 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 37 [2018-01-21 10:06:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:09,449 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-01-21 10:06:09,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-21 10:06:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-01-21 10:06:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:06:09,450 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:09,450 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-21 10:06:09,450 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-21 10:06:09,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:09,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:09,451 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:06:09,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:09,451 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:09,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,646 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:06:09,646 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:06:09,646 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:06:09,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,646 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:06:09,655 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:09,655 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:09,663 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,666 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,667 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:09,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,731 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,802 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:06:09,802 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 10:06:09,805 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:06:09,805 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:06:09,816 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,827 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:06:09,838 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:06:09,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:06:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,853 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:06:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:09,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:06:09,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-21 10:06:09,878 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:06:09,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 10:06:09,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 10:06:09,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-01-21 10:06:09,879 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 13 states. [2018-01-21 10:06:10,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:10,051 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2018-01-21 10:06:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 10:06:10,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-21 10:06:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:10,092 INFO L225 Difference]: With dead ends: 232 [2018-01-21 10:06:10,092 INFO L226 Difference]: Without dead ends: 194 [2018-01-21 10:06:10,093 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-01-21 10:06:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-21 10:06:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 126. [2018-01-21 10:06:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 10:06:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-01-21 10:06:10,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 37 [2018-01-21 10:06:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:10,105 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-01-21 10:06:10,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 10:06:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-01-21 10:06:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 10:06:10,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:10,106 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-21 10:06:10,106 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-21 10:06:10,107 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:10,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,107 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:06:10,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:10,139 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:06:10,146 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:10,152 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:10,152 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:10,167 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:10,167 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:10,167 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:10,167 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:10,168 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:10,168 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:10,168 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:10,168 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:06:10,168 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-21 10:06:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:06:10,169 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:10,170 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:06:10,170 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-21 10:06:10,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:10,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:10,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:10,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:10,181 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-21 10:06:10,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:10,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:06:10,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:10,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:06:10,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:06:10,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:10,182 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-21 10:06:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:10,184 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-21 10:06:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:06:10,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 10:06:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:10,185 INFO L225 Difference]: With dead ends: 70 [2018-01-21 10:06:10,185 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 10:06:10,186 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-21 10:06:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 10:06:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 10:06:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 10:06:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-21 10:06:10,188 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-21 10:06:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:10,188 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-21 10:06:10,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:06:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-21 10:06:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:06:10,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:10,189 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] [2018-01-21 10:06:10,189 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-21 10:06:10,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:10,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:10,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:10,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:10,243 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-21 10:06:10,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:10,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:06:10,244 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:10,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:06:10,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:06:10,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:06:10,245 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-21 10:06:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:10,261 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-21 10:06:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:06:10,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 10:06:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:10,262 INFO L225 Difference]: With dead ends: 105 [2018-01-21 10:06:10,262 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 10:06:10,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:06:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 10:06:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-21 10:06:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 10:06:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 10:06:10,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-21 10:06:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:10,264 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 10:06:10,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:06:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 10:06:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:06:10,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:10,265 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] [2018-01-21 10:06:10,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-21 10:06:10,265 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:10,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:10,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:10,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:10,294 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-21 10:06:10,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:10,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:06:10,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:10,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:06:10,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:06:10,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:10,295 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-21 10:06:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:10,320 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-21 10:06:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:06:10,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 10:06:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:10,321 INFO L225 Difference]: With dead ends: 71 [2018-01-21 10:06:10,321 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 10:06:10,321 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 10:06:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-21 10:06:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:06:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 10:06:10,323 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-21 10:06:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:10,323 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 10:06:10,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:06:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 10:06:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 10:06:10,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:10,324 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] [2018-01-21 10:06:10,324 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:10,324 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-21 10:06:10,324 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:10,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:10,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:10,325 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:10,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:06:10,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:10,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:06:10,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:10,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:06:10,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:06:10,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:10,367 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 10:06:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:10,381 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-21 10:06:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:06:10,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 10:06:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:10,382 INFO L225 Difference]: With dead ends: 43 [2018-01-21 10:06:10,382 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:06:10,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:06:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:06:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:06:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:06:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:06:10,383 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 10:06:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:10,383 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:06:10,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:06:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:06:10,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:06:10,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:06:10 BoogieIcfgContainer [2018-01-21 10:06:10,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:06:10,387 INFO L168 Benchmark]: Toolchain (without parser) took 23091.10 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 844.1 MB). Free memory was 264.5 MB in the beginning and 996.5 MB in the end (delta: -732.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:10,387 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:06:10,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.96 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:10,388 INFO L168 Benchmark]: Boogie Preprocessor took 33.71 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:10,388 INFO L168 Benchmark]: RCFGBuilder took 268.57 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:10,388 INFO L168 Benchmark]: TraceAbstraction took 22559.61 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 844.1 MB). Free memory was 234.8 MB in the beginning and 996.5 MB in the end (delta: -761.8 MB). Peak memory consumption was 82.3 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:10,389 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.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.96 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.71 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.57 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22559.61 ms. Allocated memory was 306.2 MB in the beginning and 1.2 GB in the end (delta: 844.1 MB). Free memory was 234.8 MB in the beginning and 996.5 MB in the end (delta: -761.8 MB). Peak memory consumption was 82.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 319 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 34.683847 RENAME_VARIABLES(MILLISECONDS) : 0.027475 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 34.077623 PROJECTAWAY(MILLISECONDS) : 159.418708 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.107771 DISJOIN(MILLISECONDS) : 5.568975 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.050338 ADD_EQUALITY(MILLISECONDS) : 0.049285 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019717 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 113 #UNFREEZE : 0 #CONJOIN : 92 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 111 #ADD_EQUALITY : 44 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 361 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 49 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 24.845528 RENAME_VARIABLES(MILLISECONDS) : 0.021213 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 24.638725 PROJECTAWAY(MILLISECONDS) : 37.673820 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072413 DISJOIN(MILLISECONDS) : 1.890911 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.045151 ADD_EQUALITY(MILLISECONDS) : 0.033398 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017164 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 50 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 98 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 15.173433 RENAME_VARIABLES(MILLISECONDS) : 0.016309 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.004371 PROJECTAWAY(MILLISECONDS) : 34.320374 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065912 DISJOIN(MILLISECONDS) : 1.596742 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.030239 ADD_EQUALITY(MILLISECONDS) : 0.021181 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010391 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 5 #RENAME_VARIABLES_DISJUNCTIVE : 132 #ADD_EQUALITY : 48 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 364 LocStat_NO_SUPPORTING_DISEQUALITIES : 67 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.035651 RENAME_VARIABLES(MILLISECONDS) : 0.011793 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.892138 PROJECTAWAY(MILLISECONDS) : 24.663393 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046701 DISJOIN(MILLISECONDS) : 0.573900 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.022071 ADD_EQUALITY(MILLISECONDS) : 0.015197 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008959 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 217 #UNFREEZE : 0 #CONJOIN : 148 #PROJECTAWAY : 154 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 214 #ADD_EQUALITY : 49 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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, 45 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=45occurred 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: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={13:0}, length=3] [L545] int *arr = __builtin_alloca (length*sizeof(int)); [L546] i=0 VAL [__builtin_alloca (length*sizeof(int))={13:0}, arr={13:0}, i=0, length=3] [L546] COND TRUE i