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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:12:20,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:12:20,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:12:20,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:12:20,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:12:20,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:12:20,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:12:20,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:12:20,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:12:20,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:12:20,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:12:20,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:12:20,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:12:20,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:12:20,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:12:20,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:12:20,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:12:20,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:12:20,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:12:20,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:12:20,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:12:20,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:12:20,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:12:20,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:12:20,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:12:20,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:12:20,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:12:20,115 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:12:20,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:12:20,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:12:20,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:12:20,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:12:20,126 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:12:20,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:12:20,127 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:12:20,128 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:12:20,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:12:20,128 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:12:20,128 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:12:20,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:12:20,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:12:20,129 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:12:20,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:12:20,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:12:20,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:12:20,130 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:12:20,130 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:12:20,130 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:12:20,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:12:20,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:12:20,131 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:12:20,131 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:12:20,131 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:12:20,132 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:12:20,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:12:20,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:12:20,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:12:20,133 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:12:20,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:12:20,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:12:20,133 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:12:20,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:12:20,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:12:20,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:12:20,134 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:12:20,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:12:20,135 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:12:20,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:12:20,184 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:12:20,188 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:12:20,190 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:12:20,190 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:12:20,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:12:20,370 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:12:20,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:12:20,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:12:20,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:12:20,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:12:20,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20, skipping insertion in model container [2018-01-24 15:12:20,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,399 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:12:20,438 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:12:20,554 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:12:20,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:12:20,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20 WrapperNode [2018-01-24 15:12:20,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:12:20,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:12:20,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:12:20,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:12:20,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (1/1) ... [2018-01-24 15:12:20,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:12:20,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:12:20,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:12:20,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:12:20,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (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-24 15:12:20,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:12:20,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:12:20,667 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 15:12:20,667 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:12:20,667 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 15:12:20,668 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:12:20,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:12:20,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:12:20,873 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:12:20,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:12:20 BoogieIcfgContainer [2018-01-24 15:12:20,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:12:20,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:12:20,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:12:20,876 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:12:20,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:12:20" (1/3) ... [2018-01-24 15:12:20,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29514a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:12:20, skipping insertion in model container [2018-01-24 15:12:20,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:12:20" (2/3) ... [2018-01-24 15:12:20,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29514a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:12:20, skipping insertion in model container [2018-01-24 15:12:20,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:12:20" (3/3) ... [2018-01-24 15:12:20,879 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:12:20,887 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:12:20,892 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 15:12:20,937 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:12:20,938 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:12:20,938 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:12:20,938 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:12:20,938 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:12:20,938 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:12:20,938 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:12:20,939 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:12:20,939 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:12:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 15:12:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:12:20,966 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:20,967 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:20,967 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-01-24 15:12:20,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:21,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:21,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:21,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:21,250 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-24 15:12:21,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:21,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:21,252 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:21,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:12:21,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:12:21,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:12:21,267 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 15:12:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:21,493 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 15:12:21,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:12:21,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:12:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:21,506 INFO L225 Difference]: With dead ends: 78 [2018-01-24 15:12:21,507 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 15:12:21,510 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 15:12:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 15:12:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 15:12:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 15:12:21,540 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-01-24 15:12:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:21,541 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 15:12:21,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:12:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 15:12:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:12:21,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:21,542 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:21,542 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-01-24 15:12:21,542 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:21,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:21,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:21,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:21,709 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-24 15:12:21,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:21,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:12:21,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:21,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:12:21,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:12:21,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:12:21,715 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-01-24 15:12:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:21,801 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-24 15:12:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:12:21,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 15:12:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:21,803 INFO L225 Difference]: With dead ends: 52 [2018-01-24 15:12:21,803 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:12:21,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:12:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:12:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:12:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:12:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 15:12:21,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-01-24 15:12:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:21,812 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 15:12:21,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:12:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 15:12:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:12:21,813 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:21,813 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:21,813 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-01-24 15:12:21,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:21,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:21,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,814 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:21,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:21,857 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-24 15:12:21,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:21,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:21,857 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:21,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:12:21,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:12:21,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:12:21,858 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-01-24 15:12:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:21,918 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 15:12:21,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:12:21,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:12:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:21,919 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:12:21,920 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:12:21,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 15:12:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:12:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 15:12:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:12:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 15:12:21,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-01-24 15:12:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:21,928 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 15:12:21,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:12:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 15:12:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:12:21,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:21,929 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:21,929 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-01-24 15:12:21,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:21,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:21,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:21,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:21,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,018 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-24 15:12:22,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:12:22,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:12:22,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:12:22,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:22,020 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-24 15:12:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,051 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 15:12:22,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:12:22,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:12:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,053 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:12:22,053 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:12:22,053 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:12:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:12:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 15:12:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:12:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 15:12:22,060 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-24 15:12:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,061 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 15:12:22,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:12:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 15:12:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:12:22,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,062 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-24 15:12:22,062 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-01-24 15:12:22,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,122 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-24 15:12:22,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:12:22,123 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:12:22,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:12:22,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:22,124 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-24 15:12:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,198 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 15:12:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:12:22,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 15:12:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,199 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:12:22,199 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:12:22,200 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:12:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:12:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:12:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:12:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 15:12:22,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-01-24 15:12:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,207 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 15:12:22,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:12:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 15:12:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:12:22,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,208 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-24 15:12:22,208 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-01-24 15:12:22,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,338 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-24 15:12:22,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:12:22,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:12:22,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:12:22,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:12:22,340 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-01-24 15:12:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,452 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-01-24 15:12:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:12:22,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 15:12:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,456 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:12:22,456 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:12:22,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:12:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:12:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-24 15:12:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:12:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 15:12:22,464 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-01-24 15:12:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,465 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 15:12:22,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:12:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 15:12:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:12:22,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,466 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] [2018-01-24 15:12:22,466 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-01-24 15:12:22,467 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,544 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-24 15:12:22,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:12:22,544 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:12:22,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:12:22,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:12:22,545 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-01-24 15:12:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,633 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 15:12:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:12:22,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 15:12:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,635 INFO L225 Difference]: With dead ends: 55 [2018-01-24 15:12:22,635 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 15:12:22,636 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:12:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 15:12:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 15:12:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:12:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 15:12:22,642 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-01-24 15:12:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,642 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 15:12:22,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:12:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 15:12:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:12:22,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,644 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] [2018-01-24 15:12:22,644 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-01-24 15:12:22,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,646 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,770 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-24 15:12:22,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:12:22,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:12:22,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:12:22,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:12:22,772 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-01-24 15:12:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,886 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-24 15:12:22,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:12:22,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 15:12:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,887 INFO L225 Difference]: With dead ends: 62 [2018-01-24 15:12:22,887 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 15:12:22,887 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:12:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 15:12:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-24 15:12:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:12:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 15:12:22,895 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-01-24 15:12:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,896 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 15:12:22,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:12:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 15:12:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:12:22,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,897 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] [2018-01-24 15:12:22,897 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-01-24 15:12:22,897 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:22,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:22,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:12:22,936 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:22,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:12:22,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:12:22,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:12:22,937 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-01-24 15:12:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:22,945 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 15:12:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:12:22,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 15:12:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:22,946 INFO L225 Difference]: With dead ends: 85 [2018-01-24 15:12:22,946 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:12:22,947 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-24 15:12:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:12:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 15:12:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 15:12:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-24 15:12:22,953 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-01-24 15:12:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:22,954 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-24 15:12:22,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:12:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-24 15:12:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:12:22,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:22,955 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] [2018-01-24 15:12:22,955 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-01-24 15:12:22,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:22,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:22,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:22,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:22,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:23,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:12:23,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:12:23,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:23,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:12:23,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:12:23,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:12:23,346 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-01-24 15:12:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:23,869 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-24 15:12:23,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:12:23,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 15:12:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:23,870 INFO L225 Difference]: With dead ends: 122 [2018-01-24 15:12:23,870 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 15:12:23,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-01-24 15:12:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 15:12:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 15:12:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:12:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 15:12:23,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-01-24 15:12:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:23,881 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 15:12:23,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:12:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 15:12:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:12:23,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:23,882 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] [2018-01-24 15:12:23,882 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-01-24 15:12:23,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:23,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:23,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:23,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:23,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:23,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:24,116 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-24 15:12:24,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:24,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:24,118 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:12:24,119 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [61], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 15:12:24,161 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:12:24,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:12:26,737 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:12:26,739 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 15:12:26,761 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:12:26,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:26,762 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-24 15:12:26,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:26,771 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:26,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:26,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 15:12:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 15:12:26,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:26,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:26,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:26,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 15:12:27,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 15:12:27,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-24 15:12:27,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,297 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 19 treesize of output 12 [2018-01-24 15:12:27,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,313 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 12 [2018-01-24 15:12:27,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:27,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2018-01-24 15:12:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:27,400 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:27,673 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 13 treesize of output 11 [2018-01-24 15:12:27,688 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 5 treesize of output 3 [2018-01-24 15:12:27,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:27,692 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-24 15:12:27,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 15:12:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:27,735 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:12:27,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [13] total 29 [2018-01-24 15:12:27,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:12:27,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:12:27,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:12:27,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-01-24 15:12:27,737 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 12 states. [2018-01-24 15:12:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:28,311 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2018-01-24 15:12:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:12:28,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 15:12:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:28,313 INFO L225 Difference]: With dead ends: 169 [2018-01-24 15:12:28,313 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 15:12:28,314 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:12:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 15:12:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2018-01-24 15:12:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 15:12:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-01-24 15:12:28,326 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 26 [2018-01-24 15:12:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:28,326 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-01-24 15:12:28,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:12:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-01-24 15:12:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:12:28,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:28,327 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] [2018-01-24 15:12:28,328 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1152136182, now seen corresponding path program 1 times [2018-01-24 15:12:28,328 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:28,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:28,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:28,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:28,329 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:28,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:28,671 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-24 15:12:28,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:28,672 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:28,672 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:12:28,672 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [63], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 15:12:28,675 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:12:28,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:12:30,068 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:12:30,068 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 15:12:30,072 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:12:30,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:30,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:12:30,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:30,080 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:30,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:30,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:30,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:12:30,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:30,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:30,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:12:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:12:30,269 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 14 treesize of output 11 [2018-01-24 15:12:30,272 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 11 treesize of output 10 [2018-01-24 15:12:30,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:30,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 15:12:30,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 15:12:30,356 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 11 treesize of output 10 [2018-01-24 15:12:30,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:30,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 15:12:30,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 15:12:30,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:12:30,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:30,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 15:12:30,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:30,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:30,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:30,615 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 15:12:30,800 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-24 15:12:30,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:31,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 15:12:31,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,218 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 13 treesize of output 11 [2018-01-24 15:12:31,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:31,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 15:12:31,298 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-24 15:12:31,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:31,330 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:12:31,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:31,334 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:31,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:31,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:31,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:31,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:12:31,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:31,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:12:31,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:31,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:31,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:12:31,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:12:31,524 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 16 treesize of output 13 [2018-01-24 15:12:31,526 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 13 treesize of output 12 [2018-01-24 15:12:31,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:12:31,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 15:12:31,571 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 13 treesize of output 12 [2018-01-24 15:12:31,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:31,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:12:31,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-24 15:12:31,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-01-24 15:12:31,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:31,735 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 10 treesize of output 1 [2018-01-24 15:12:31,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:31,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:31,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:31,744 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:35 [2018-01-24 15:12:31,885 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-24 15:12:31,885 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:32,083 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 13 treesize of output 11 [2018-01-24 15:12:32,091 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 5 treesize of output 3 [2018-01-24 15:12:32,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:32,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:32,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:32,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 15:12:32,253 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-24 15:12:32,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:12:32,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10, 13, 11] total 49 [2018-01-24 15:12:32,255 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:12:32,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 15:12:32,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 15:12:32,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 15:12:32,256 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 25 states. [2018-01-24 15:12:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:33,573 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2018-01-24 15:12:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:12:33,574 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-01-24 15:12:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:33,576 INFO L225 Difference]: With dead ends: 147 [2018-01-24 15:12:33,576 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 15:12:33,577 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=390, Invalid=3642, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 15:12:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 15:12:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2018-01-24 15:12:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 15:12:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-24 15:12:33,590 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 26 [2018-01-24 15:12:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:33,591 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-24 15:12:33,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 15:12:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-24 15:12:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 15:12:33,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:33,592 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:33,592 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash 352566928, now seen corresponding path program 1 times [2018-01-24 15:12:33,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:33,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:33,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:33,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:33,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:33,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:34,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:34,040 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:34,040 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 15:12:34,040 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [18], [20], [21], [29], [52], [57], [63], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 15:12:34,041 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:12:34,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:12:35,003 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:12:35,003 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 15:12:35,010 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:12:35,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:35,011 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:12:35,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:35,018 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:35,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:35,048 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 14 treesize of output 11 [2018-01-24 15:12:35,050 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 11 treesize of output 10 [2018-01-24 15:12:35,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:35,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:35,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:35,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:12:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-24 15:12:35,470 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-24 15:12:35,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:35,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 15:12:35,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:35,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-01-24 15:12:35,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-24 15:12:35,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 15:12:35,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:12:35,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:66 [2018-01-24 15:12:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:35,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:36,058 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 15:12:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 15:12:36,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 15:12:36,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,120 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 16 treesize of output 14 [2018-01-24 15:12:36,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,132 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 15:12:36,132 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,144 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-24 15:12:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:36,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:36,171 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:12:36,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:36,177 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:12:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:36,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:36,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:36,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:12:36,295 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 16 treesize of output 13 [2018-01-24 15:12:36,297 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 13 treesize of output 12 [2018-01-24 15:12:36,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:12:36,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-01-24 15:12:36,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 15:12:36,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:36,587 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-01-24 15:12:36,588 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,589 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-24 15:12:36,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-01-24 15:12:36,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-24 15:12:36,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 15:12:36,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:12:36,675 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:62 [2018-01-24 15:12:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:36,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:36,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 15:12:36,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 15:12:36,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:36,953 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-24 15:12:36,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:14 [2018-01-24 15:12:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:37,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:12:37,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-24 15:12:37,035 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:12:37,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 15:12:37,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 15:12:37,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 15:12:37,037 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 24 states. [2018-01-24 15:12:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:12:38,234 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 15:12:38,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:12:38,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-01-24 15:12:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:12:38,236 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:12:38,236 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 15:12:38,237 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=471, Invalid=3689, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 15:12:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 15:12:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-01-24 15:12:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 15:12:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-01-24 15:12:38,250 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2018-01-24 15:12:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:12:38,250 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-01-24 15:12:38,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 15:12:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-01-24 15:12:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:12:38,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:12:38,252 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:12:38,252 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:12:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1490010362, now seen corresponding path program 2 times [2018-01-24 15:12:38,253 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:12:38,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:38,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:12:38,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:12:38,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:12:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:12:38,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:12:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:38,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:38,686 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:12:38,686 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:12:38,686 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:12:38,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:38,686 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:12:38,691 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:12:38,691 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:12:38,702 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:38,715 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:38,717 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:12:38,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:38,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:38,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:12:38,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:38,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:38,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:12:38,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 15:12:38,807 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 14 treesize of output 11 [2018-01-24 15:12:38,808 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 11 treesize of output 10 [2018-01-24 15:12:38,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:38,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 15:12:38,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 15:12:38,846 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 11 treesize of output 10 [2018-01-24 15:12:38,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:38,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:38,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-01-24 15:12:39,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 15:12:39,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:39,536 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-24 15:12:39,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:39,551 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 8 treesize of output 1 [2018-01-24 15:12:39,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:39,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:39,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:39,569 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:57, output treesize:43 [2018-01-24 15:12:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:39,657 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:40,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-24 15:12:40,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-24 15:12:40,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,095 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 34 treesize of output 30 [2018-01-24 15:12:40,112 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:12:40,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:12:40,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,126 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 32 treesize of output 28 [2018-01-24 15:12:40,140 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:12:40,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:12:40,141 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:40,152 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-01-24 15:12:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:40,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:12:40,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:12:40,369 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:12:40,369 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:12:40,383 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:40,404 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:12:40,434 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:12:40,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:12:40,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:40,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:12:40,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:12:40,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:40,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:12:40,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:40,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:12:40,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:12:40,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:12:40,604 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 16 treesize of output 13 [2018-01-24 15:12:40,605 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 13 treesize of output 12 [2018-01-24 15:12:40,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:12:40,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 15:12:40,656 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 13 treesize of output 12 [2018-01-24 15:12:40,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:12:40,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:12:40,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 15:12:40,891 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 10 treesize of output 1 [2018-01-24 15:12:40,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:40,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:12:40,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:12:40,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:40,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:12:40,911 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 15:12:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:40,946 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:12:41,288 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 13 treesize of output 11 [2018-01-24 15:12:41,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:12:41,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:12:41,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:12:41,303 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-24 15:12:41,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 15:12:41,735 WARN L143 SmtUtils]: Spent 291ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 15:12:41,970 WARN L143 SmtUtils]: Spent 156ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 15:12:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:12:41,985 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:12:41,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 16, 14, 12] total 57 [2018-01-24 15:12:41,985 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:12:41,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 15:12:41,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 15:12:41,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3095, Unknown=1, NotChecked=0, Total=3306 [2018-01-24 15:12:41,987 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 29 states. [2018-01-24 15:12:45,377 WARN L146 SmtUtils]: Spent 2833ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-01-24 15:12:50,910 WARN L146 SmtUtils]: Spent 5477ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-24 15:12:55,769 WARN L146 SmtUtils]: Spent 4803ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-24 15:12:56,256 WARN L146 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-24 15:12:59,105 WARN L146 SmtUtils]: Spent 646ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-01-24 15:13:01,683 WARN L146 SmtUtils]: Spent 2513ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-01-24 15:13:07,439 WARN L146 SmtUtils]: Spent 5663ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-01-24 15:13:09,439 WARN L146 SmtUtils]: Spent 1915ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-01-24 15:13:13,435 WARN L146 SmtUtils]: Spent 3923ms on a formula simplification. DAG size of input: 94 DAG size of output 77 Received shutdown request... [2018-01-24 15:13:16,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:13:16,086 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:13:16,089 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:13:16,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:13:16 BoogieIcfgContainer [2018-01-24 15:13:16,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:13:16,090 INFO L168 Benchmark]: Toolchain (without parser) took 55719.60 ms. Allocated memory was 309.3 MB in the beginning and 796.9 MB in the end (delta: 487.6 MB). Free memory was 268.2 MB in the beginning and 328.7 MB in the end (delta: -60.4 MB). Peak memory consumption was 427.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:13:16,090 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 309.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:13:16,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.92 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 258.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:13:16,091 INFO L168 Benchmark]: Boogie Preprocessor took 34.89 ms. Allocated memory is still 309.3 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:13:16,091 INFO L168 Benchmark]: RCFGBuilder took 256.45 ms. Allocated memory is still 309.3 MB. Free memory was 256.2 MB in the beginning and 237.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:13:16,091 INFO L168 Benchmark]: TraceAbstraction took 55214.95 ms. Allocated memory was 309.3 MB in the beginning and 796.9 MB in the end (delta: 487.6 MB). Free memory was 237.3 MB in the beginning and 328.7 MB in the end (delta: -91.4 MB). Peak memory consumption was 396.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:13:16,093 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.19 ms. Allocated memory is still 309.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.92 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 258.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.89 ms. Allocated memory is still 309.3 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 256.45 ms. Allocated memory is still 309.3 MB. Free memory was 256.2 MB in the beginning and 237.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55214.95 ms. Allocated memory was 309.3 MB in the beginning and 796.9 MB in the end (delta: 487.6 MB). Free memory was 237.3 MB in the beginning and 328.7 MB in the end (delta: -91.4 MB). Peak memory consumption was 396.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 286 LocStat_NO_SUPPORTING_DISEQUALITIES : 54 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.801471 RENAME_VARIABLES(MILLISECONDS) : 1.088742 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.721199 PROJECTAWAY(MILLISECONDS) : 16.666125 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.085011 DISJOIN(MILLISECONDS) : 0.561408 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.139964 ADD_EQUALITY(MILLISECONDS) : 0.015308 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011180 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 135 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 288 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.293027 RENAME_VARIABLES(MILLISECONDS) : 0.420485 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.250220 PROJECTAWAY(MILLISECONDS) : 1.324188 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091145 DISJOIN(MILLISECONDS) : 0.374576 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.450668 ADD_EQUALITY(MILLISECONDS) : 0.013062 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007370 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 267 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.411867 RENAME_VARIABLES(MILLISECONDS) : 0.349635 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.370257 PROJECTAWAY(MILLISECONDS) : 0.961656 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054998 DISJOIN(MILLISECONDS) : 0.387321 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.378778 ADD_EQUALITY(MILLISECONDS) : 0.012567 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007763 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 55.1s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 1093 SDslu, 2442 SDs, 0 SdLazy, 2127 SolverSat, 218 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 281 SyntacticMatches, 19 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3498 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.0s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 683 ConstructedInterpolants, 74 QuantifiedInterpolants, 236293 SizeOfPredicates, 124 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 8/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-13-16-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-13-16-103.csv Completed graceful shutdown