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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 20:58:49,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 20:58:49,276 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 20:58:49,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 20:58:49,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 20:58:49,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 20:58:49,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 20:58:49,292 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 20:58:49,294 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 20:58:49,295 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 20:58:49,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 20:58:49,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 20:58:49,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 20:58:49,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 20:58:49,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 20:58:49,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 20:58:49,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 20:58:49,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 20:58:49,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 20:58:49,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 20:58:49,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 20:58:49,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 20:58:49,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 20:58:49,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 20:58:49,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 20:58:49,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 20:58:49,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 20:58:49,314 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 20:58:49,314 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 20:58:49,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 20:58:49,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 20:58:49,316 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 20:58:49,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 20:58:49,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 20:58:49,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 20:58:49,327 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 20:58:49,327 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 20:58:49,327 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 20:58:49,327 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 20:58:49,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 20:58:49,328 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 20:58:49,328 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 20:58:49,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 20:58:49,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 20:58:49,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 20:58:49,329 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 20:58:49,329 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 20:58:49,330 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 20:58:49,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 20:58:49,330 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 20:58:49,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 20:58:49,330 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 20:58:49,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 20:58:49,331 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 20:58:49,331 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 20:58:49,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 20:58:49,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 20:58:49,332 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 20:58:49,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 20:58:49,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 20:58:49,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 20:58:49,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 20:58:49,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 20:58:49,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 20:58:49,334 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 20:58:49,334 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 20:58:49,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 20:58:49,443 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 20:58:49,449 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 20:58:49,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 20:58:49,451 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 20:58:49,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:49,640 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 20:58:49,646 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 20:58:49,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:49,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 20:58:49,651 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 20:58:49,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49, skipping insertion in model container [2018-01-28 20:58:49,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:49,706 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:58:49,821 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:49,840 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:58:49,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49 WrapperNode [2018-01-28 20:58:49,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 20:58:49,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 20:58:49,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 20:58:49,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 20:58:49,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (1/1) ... [2018-01-28 20:58:49,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 20:58:49,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 20:58:49,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 20:58:49,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 20:58:49,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (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-28 20:58:49,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 20:58:49,992 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 20:58:49,992 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-28 20:58:49,993 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 20:58:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 20:58:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 20:58:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 20:58:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 20:58:49,993 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 20:58:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 20:58:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-28 20:58:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 20:58:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 20:58:49,994 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 20:58:50,200 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 20:58:50,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:50 BoogieIcfgContainer [2018-01-28 20:58:50,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 20:58:50,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 20:58:50,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 20:58:50,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 20:58:50,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:58:49" (1/3) ... [2018-01-28 20:58:50,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3025bba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:50, skipping insertion in model container [2018-01-28 20:58:50,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:49" (2/3) ... [2018-01-28 20:58:50,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3025bba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:50, skipping insertion in model container [2018-01-28 20:58:50,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:50" (3/3) ... [2018-01-28 20:58:50,207 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-28 20:58:50,213 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 20:58:50,219 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-28 20:58:50,260 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 20:58:50,260 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 20:58:50,260 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 20:58:50,260 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 20:58:50,261 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 20:58:50,261 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 20:58:50,261 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 20:58:50,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 20:58:50,262 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 20:58:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-28 20:58:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 20:58:50,290 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:50,291 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:50,292 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:50,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1358649906, now seen corresponding path program 1 times [2018-01-28 20:58:50,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:50,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:50,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:50,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:50,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:50,506 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-28 20:58:50,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:50,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 20:58:50,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 20:58:50,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 20:58:50,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 20:58:50,525 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-01-28 20:58:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:50,613 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-28 20:58:50,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 20:58:50,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-28 20:58:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:50,693 INFO L225 Difference]: With dead ends: 112 [2018-01-28 20:58:50,694 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 20:58:50,697 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 20:58:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 20:58:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 20:58:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 20:58:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-28 20:58:50,734 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-01-28 20:58:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:50,735 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-28 20:58:50,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 20:58:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-28 20:58:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 20:58:50,736 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:50,736 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:50,736 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash 291143110, now seen corresponding path program 1 times [2018-01-28 20:58:50,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:50,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:50,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:50,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:50,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:50,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:50,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:58:50,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:58:50,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:58:50,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:58:50,846 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-01-28 20:58:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:50,912 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-28 20:58:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 20:58:50,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-28 20:58:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:50,914 INFO L225 Difference]: With dead ends: 75 [2018-01-28 20:58:50,914 INFO L226 Difference]: Without dead ends: 74 [2018-01-28 20:58:50,915 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 20:58:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-28 20:58:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-28 20:58:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-28 20:58:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-28 20:58:50,922 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-28 20:58:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:50,922 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-28 20:58:50,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:58:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-28 20:58:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 20:58:50,923 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:50,923 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:50,923 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash 291143111, now seen corresponding path program 1 times [2018-01-28 20:58:50,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:50,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:50,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:50,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:50,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:51,127 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-28 20:58:51,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:51,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:58:51,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:51,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:51,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:51,129 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-01-28 20:58:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:51,359 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-28 20:58:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 20:58:51,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-28 20:58:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:51,361 INFO L225 Difference]: With dead ends: 74 [2018-01-28 20:58:51,361 INFO L226 Difference]: Without dead ends: 73 [2018-01-28 20:58:51,361 INFO L533 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-28 20:58:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-28 20:58:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-28 20:58:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-28 20:58:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-28 20:58:51,367 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-01-28 20:58:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:51,367 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-28 20:58:51,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-28 20:58:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 20:58:51,369 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:51,369 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:51,369 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash 435501890, now seen corresponding path program 1 times [2018-01-28 20:58:51,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:51,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:51,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:51,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:51,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:51,426 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-28 20:58:51,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:51,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:58:51,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:58:51,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:58:51,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:58:51,428 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-01-28 20:58:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:51,480 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-28 20:58:51,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 20:58:51,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-28 20:58:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:51,481 INFO L225 Difference]: With dead ends: 73 [2018-01-28 20:58:51,481 INFO L226 Difference]: Without dead ends: 72 [2018-01-28 20:58:51,481 INFO L533 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-28 20:58:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-28 20:58:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-28 20:58:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 20:58:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-28 20:58:51,488 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-01-28 20:58:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:51,488 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-28 20:58:51,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:58:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-28 20:58:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 20:58:51,489 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:51,490 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:51,490 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 435501891, now seen corresponding path program 1 times [2018-01-28 20:58:51,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:51,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:51,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:51,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:51,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:51,588 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-28 20:58:51,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:51,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 20:58:51,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 20:58:51,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 20:58:51,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:51,589 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 7 states. [2018-01-28 20:58:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:51,729 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-28 20:58:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 20:58:51,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-28 20:58:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:51,730 INFO L225 Difference]: With dead ends: 72 [2018-01-28 20:58:51,730 INFO L226 Difference]: Without dead ends: 71 [2018-01-28 20:58:51,730 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:58:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-28 20:58:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-28 20:58:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-28 20:58:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-28 20:58:51,736 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-28 20:58:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:51,736 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-28 20:58:51,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 20:58:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-28 20:58:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 20:58:51,737 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:51,737 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:51,737 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353202, now seen corresponding path program 1 times [2018-01-28 20:58:51,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:51,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:51,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:51,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:51,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:51,828 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-28 20:58:51,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:51,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:58:51,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:51,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:51,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:51,830 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-01-28 20:58:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:51,927 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-28 20:58:51,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 20:58:51,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-28 20:58:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:51,929 INFO L225 Difference]: With dead ends: 78 [2018-01-28 20:58:51,929 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 20:58:51,929 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:58:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 20:58:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-01-28 20:58:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-28 20:58:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-28 20:58:51,937 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-01-28 20:58:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:51,937 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-28 20:58:51,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-28 20:58:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 20:58:51,939 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:51,939 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:51,939 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353203, now seen corresponding path program 1 times [2018-01-28 20:58:51,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:51,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:51,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:51,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:51,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:52,060 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-28 20:58:52,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:52,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 20:58:52,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 20:58:52,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 20:58:52,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:58:52,062 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-28 20:58:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:52,400 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-28 20:58:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 20:58:52,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-28 20:58:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:52,402 INFO L225 Difference]: With dead ends: 82 [2018-01-28 20:58:52,402 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 20:58:52,402 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-28 20:58:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 20:58:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-01-28 20:58:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-28 20:58:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-28 20:58:52,410 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-01-28 20:58:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:52,410 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-28 20:58:52,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 20:58:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-28 20:58:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 20:58:52,411 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:52,412 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:52,412 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash -789761369, now seen corresponding path program 1 times [2018-01-28 20:58:52,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:52,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:52,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:52,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:52,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:52,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 20:58:52,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:52,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 20:58:52,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 20:58:52,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 20:58:52,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:52,481 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-01-28 20:58:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:52,560 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-28 20:58:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 20:58:52,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-28 20:58:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:52,561 INFO L225 Difference]: With dead ends: 76 [2018-01-28 20:58:52,561 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 20:58:52,561 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 20:58:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 20:58:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-01-28 20:58:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-28 20:58:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-28 20:58:52,567 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-01-28 20:58:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:52,567 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-28 20:58:52,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 20:58:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-28 20:58:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 20:58:52,568 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:52,568 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:52,568 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash -789761368, now seen corresponding path program 1 times [2018-01-28 20:58:52,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:52,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:52,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:52,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:52,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:52,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:52,748 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-28 20:58:52,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:52,748 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:58:52,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:52,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:52,865 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-28 20:58:52,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:52,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:52,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-28 20:58:52,934 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-28 20:58:52,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:52,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-28 20:58:52,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 20:58:52,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 20:58:52,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:58:52,969 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 11 states. [2018-01-28 20:58:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:53,376 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-28 20:58:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 20:58:53,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-28 20:58:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:53,377 INFO L225 Difference]: With dead ends: 92 [2018-01-28 20:58:53,378 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 20:58:53,378 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-28 20:58:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 20:58:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-28 20:58:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-28 20:58:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-28 20:58:53,385 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-01-28 20:58:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:53,388 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-28 20:58:53,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 20:58:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-28 20:58:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 20:58:53,389 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:53,390 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:53,390 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136617, now seen corresponding path program 1 times [2018-01-28 20:58:53,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:53,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:53,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:53,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:53,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:53,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:53,494 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-28 20:58:53,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:53,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:58:53,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:58:53,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:58:53,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:58:53,495 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-28 20:58:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:53,598 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-28 20:58:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 20:58:53,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-28 20:58:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:53,599 INFO L225 Difference]: With dead ends: 79 [2018-01-28 20:58:53,599 INFO L226 Difference]: Without dead ends: 78 [2018-01-28 20:58:53,599 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:58:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-28 20:58:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-28 20:58:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-28 20:58:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-28 20:58:53,606 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-01-28 20:58:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:53,606 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-28 20:58:53,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:58:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-28 20:58:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 20:58:53,607 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:53,607 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:53,607 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136616, now seen corresponding path program 1 times [2018-01-28 20:58:53,608 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:53,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:53,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:53,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:53,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:53,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:53,818 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 8 DAG size of output 7 [2018-01-28 20:58:53,928 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-28 20:58:53,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:53,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 20:58:53,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 20:58:53,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 20:58:53,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 20:58:53,929 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-01-28 20:58:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:54,142 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-28 20:58:54,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 20:58:54,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-28 20:58:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:54,143 INFO L225 Difference]: With dead ends: 93 [2018-01-28 20:58:54,143 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 20:58:54,144 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-28 20:58:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 20:58:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-28 20:58:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 20:58:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-28 20:58:54,153 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-01-28 20:58:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:54,153 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-28 20:58:54,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 20:58:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-28 20:58:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:58:54,154 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:54,154 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:54,154 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 219274321, now seen corresponding path program 1 times [2018-01-28 20:58:54,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:54,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:54,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:54,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:54,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:54,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:54,229 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-28 20:58:54,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:54,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 20:58:54,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 20:58:54,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 20:58:54,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 20:58:54,231 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-01-28 20:58:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:54,363 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-28 20:58:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 20:58:54,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-28 20:58:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:54,364 INFO L225 Difference]: With dead ends: 84 [2018-01-28 20:58:54,364 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 20:58:54,365 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 20:58:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 20:58:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 20:58:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 20:58:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-28 20:58:54,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-01-28 20:58:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:54,373 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-28 20:58:54,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 20:58:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-28 20:58:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:58:54,374 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:54,375 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:54,375 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash 219274322, now seen corresponding path program 1 times [2018-01-28 20:58:54,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:54,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:54,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:54,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:54,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:54,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:54,571 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-28 20:58:54,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:58:54,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 20:58:54,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 20:58:54,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 20:58:54,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 20:58:54,572 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 9 states. [2018-01-28 20:58:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:55,010 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-01-28 20:58:55,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 20:58:55,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 20:58:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:55,011 INFO L225 Difference]: With dead ends: 95 [2018-01-28 20:58:55,011 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 20:58:55,011 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-28 20:58:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 20:58:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-28 20:58:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-28 20:58:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-28 20:58:55,018 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 40 [2018-01-28 20:58:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:55,018 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-28 20:58:55,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 20:58:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-28 20:58:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 20:58:55,019 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:55,020 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:55,020 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash 564346387, now seen corresponding path program 2 times [2018-01-28 20:58:55,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:55,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:55,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:55,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:55,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:55,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:55,755 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-28 20:58:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:56,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:56,067 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:58:56,075 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:58:56,094 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:56,114 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:58:56,116 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:58:56,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:56,144 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-28 20:58:56,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:56,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:56,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-28 20:58:56,203 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-28 20:58:56,205 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-28 20:58:56,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:56,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:56,221 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-28 20:58:56,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 20:58:56,405 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 17 treesize of output 13 [2018-01-28 20:58:56,411 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 13 treesize of output 14 [2018-01-28 20:58:56,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:56,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:56,429 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-28 20:58:56,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-28 20:58:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:56,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:56,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-01-28 20:58:56,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 20:58:56,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 20:58:56,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-01-28 20:58:56,576 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 26 states. [2018-01-28 20:58:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:57,271 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-28 20:58:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 20:58:57,271 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-01-28 20:58:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:57,271 INFO L225 Difference]: With dead ends: 113 [2018-01-28 20:58:57,272 INFO L226 Difference]: Without dead ends: 112 [2018-01-28 20:58:57,272 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 20:58:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-28 20:58:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-01-28 20:58:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 20:58:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-28 20:58:57,278 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2018-01-28 20:58:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:57,278 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-28 20:58:57,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 20:58:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-28 20:58:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 20:58:57,279 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:57,279 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:57,279 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 141736189, now seen corresponding path program 1 times [2018-01-28 20:58:57,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:57,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:57,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:57,281 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:58:57,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:57,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:57,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:57,429 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:58:57,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:57,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:57,462 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-28 20:58:57,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:57,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:57,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-28 20:58:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:58:57,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:57,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-01-28 20:58:57,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 20:58:57,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 20:58:57,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-28 20:58:57,578 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 18 states. [2018-01-28 20:58:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:58:57,890 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-28 20:58:57,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 20:58:57,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-28 20:58:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:58:57,891 INFO L225 Difference]: With dead ends: 110 [2018-01-28 20:58:57,891 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 20:58:57,892 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-28 20:58:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 20:58:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-01-28 20:58:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 20:58:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-28 20:58:57,899 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2018-01-28 20:58:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:58:57,899 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-28 20:58:57,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 20:58:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-28 20:58:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 20:58:57,900 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:58:57,901 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:58:57,901 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:58:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash -220320392, now seen corresponding path program 1 times [2018-01-28 20:58:57,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:58:57,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:58:57,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:57,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:57,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:58:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:57,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:58:58,310 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-28 20:58:58,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:58:58,575 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:58:58,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:58:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:58:58,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:58:58,618 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-28 20:58:58,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:58,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:58,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 20:58:58,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:58:58,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:58:59,280 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-28 20:58:59,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 20:58:59,315 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-28 20:58:59,317 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-28 20:58:59,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,325 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-28 20:58:59,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 20:58:59,351 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-28 20:58:59,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-28 20:58:59,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,371 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-28 20:58:59,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 20:58:59,597 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 30 treesize of output 28 [2018-01-28 20:58:59,609 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 13 [2018-01-28 20:58:59,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:58:59,619 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-28 20:58:59,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 20:58:59,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:58:59,635 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-28 20:58:59,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-28 20:58:59,692 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-28 20:58:59,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:58:59,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-28 20:58:59,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 20:58:59,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 20:58:59,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-01-28 20:58:59,720 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 26 states. [2018-01-28 20:59:00,110 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 56 DAG size of output 34 [2018-01-28 20:59:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:00,788 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-28 20:59:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 20:59:00,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-01-28 20:59:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:00,789 INFO L225 Difference]: With dead ends: 121 [2018-01-28 20:59:00,790 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 20:59:00,790 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 20:59:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 20:59:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-01-28 20:59:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 20:59:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-28 20:59:00,798 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-28 20:59:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:00,798 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-28 20:59:00,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 20:59:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-28 20:59:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 20:59:00,799 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:00,799 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:00,799 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1760002418, now seen corresponding path program 1 times [2018-01-28 20:59:00,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:00,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:00,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:00,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:00,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:00,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:00,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:00,948 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:00,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:00,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:01,007 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-28 20:59:01,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:01,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:01,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-28 20:59:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:01,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:01,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-28 20:59:01,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 20:59:01,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 20:59:01,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-01-28 20:59:01,156 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 21 states. [2018-01-28 20:59:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:01,480 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-28 20:59:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 20:59:01,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-01-28 20:59:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:01,483 INFO L225 Difference]: With dead ends: 138 [2018-01-28 20:59:01,483 INFO L226 Difference]: Without dead ends: 137 [2018-01-28 20:59:01,483 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-01-28 20:59:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-28 20:59:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-01-28 20:59:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-28 20:59:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-28 20:59:01,490 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 51 [2018-01-28 20:59:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:01,490 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-28 20:59:01,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 20:59:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-28 20:59:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 20:59:01,490 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:01,491 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:01,491 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash -801598392, now seen corresponding path program 3 times [2018-01-28 20:59:01,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:01,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:01,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:01,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:01,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:01,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:01,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:01,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:01,977 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 20:59:01,989 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:01,992 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:01,997 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:02,001 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 20:59:02,004 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:02,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:02,020 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-28 20:59:02,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:02,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:02,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-28 20:59:02,112 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-28 20:59:02,114 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-28 20:59:02,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:02,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:02,122 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-28 20:59:02,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 20:59:02,683 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 26 treesize of output 20 [2018-01-28 20:59:02,696 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-28 20:59:02,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-28 20:59:02,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:02,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:02,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-28 20:59:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:03,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:03,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-01-28 20:59:03,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 20:59:03,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 20:59:03,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 20:59:03,051 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 39 states. [2018-01-28 20:59:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:05,486 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-28 20:59:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 20:59:05,486 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-01-28 20:59:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:05,487 INFO L225 Difference]: With dead ends: 149 [2018-01-28 20:59:05,487 INFO L226 Difference]: Without dead ends: 148 [2018-01-28 20:59:05,488 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=484, Invalid=3298, Unknown=0, NotChecked=0, Total=3782 [2018-01-28 20:59:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-28 20:59:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-01-28 20:59:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-28 20:59:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-28 20:59:05,499 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 52 [2018-01-28 20:59:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:05,499 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-28 20:59:05,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 20:59:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-28 20:59:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 20:59:05,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:05,500 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:05,500 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -507124950, now seen corresponding path program 1 times [2018-01-28 20:59:05,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:05,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:05,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:05,502 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:05,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:05,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:05,726 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-28 20:59:05,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:59:05,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:59:05,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:59:05,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:59:05,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:59:05,727 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 6 states. [2018-01-28 20:59:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:05,951 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-28 20:59:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 20:59:05,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-28 20:59:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:05,952 INFO L225 Difference]: With dead ends: 135 [2018-01-28 20:59:05,952 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 20:59:05,953 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:59:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 20:59:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-28 20:59:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-28 20:59:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-28 20:59:05,965 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 54 [2018-01-28 20:59:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:05,966 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-28 20:59:05,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:59:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-28 20:59:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 20:59:05,967 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:05,967 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:05,967 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1728796146, now seen corresponding path program 2 times [2018-01-28 20:59:05,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:05,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:05,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:05,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:05,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:05,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:06,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:06,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:06,256 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:59:06,273 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:06,278 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:06,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-28 20:59:06,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 20:59:06,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-01-28 20:59:06,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 20:59:06,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 20:59:06,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-28 20:59:06,424 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 15 states. [2018-01-28 20:59:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:06,927 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-01-28 20:59:06,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 20:59:06,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-28 20:59:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:06,929 INFO L225 Difference]: With dead ends: 129 [2018-01-28 20:59:06,929 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 20:59:06,929 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 20:59:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 20:59:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-01-28 20:59:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 20:59:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-28 20:59:06,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 54 [2018-01-28 20:59:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:06,941 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-28 20:59:06,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 20:59:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-28 20:59:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 20:59:06,941 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:06,942 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:06,942 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:06,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1598987239, now seen corresponding path program 1 times [2018-01-28 20:59:06,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:06,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:06,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:06,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:06,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:06,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:07,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:07,483 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:07,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:07,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:07,521 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-28 20:59:07,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,530 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-28 20:59:07,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-28 20:59:07,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:07,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:07,604 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-28 20:59:07,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:07,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-28 20:59:07,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:07,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-28 20:59:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:08,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:08,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-01-28 20:59:08,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-28 20:59:08,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-28 20:59:08,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 20:59:08,087 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 43 states. [2018-01-28 20:59:08,808 WARN L143 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-28 20:59:09,528 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-28 20:59:10,628 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 58 DAG size of output 48 [2018-01-28 20:59:11,061 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-01-28 20:59:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:11,744 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-01-28 20:59:11,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-28 20:59:11,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-01-28 20:59:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:11,745 INFO L225 Difference]: With dead ends: 137 [2018-01-28 20:59:11,745 INFO L226 Difference]: Without dead ends: 136 [2018-01-28 20:59:11,747 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=547, Invalid=5003, Unknown=0, NotChecked=0, Total=5550 [2018-01-28 20:59:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-28 20:59:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2018-01-28 20:59:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-28 20:59:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-28 20:59:11,753 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 58 [2018-01-28 20:59:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:11,753 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-28 20:59:11,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-28 20:59:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-28 20:59:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-28 20:59:11,754 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:11,754 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:11,754 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1498101645, now seen corresponding path program 4 times [2018-01-28 20:59:11,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:11,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:11,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:11,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:59:11,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:11,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:12,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:12,481 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:12,492 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 20:59:12,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:12,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:12,519 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-28 20:59:12,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:12,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:12,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-28 20:59:12,568 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-28 20:59:12,570 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-28 20:59:12,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:12,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:12,583 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-28 20:59:12,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 20:59:15,898 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 38 treesize of output 30 [2018-01-28 20:59:15,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:15,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:15,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:15,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-01-28 20:59:15,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:15,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:15,945 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-28 20:59:15,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-28 20:59:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:16,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:16,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2018-01-28 20:59:16,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-28 20:59:16,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-28 20:59:16,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1888, Unknown=4, NotChecked=0, Total=2070 [2018-01-28 20:59:16,212 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 46 states. [2018-01-28 20:59:17,411 WARN L146 SmtUtils]: Spent 707ms on a formula simplification. DAG size of input: 86 DAG size of output 45 [2018-01-28 20:59:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:21,367 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-01-28 20:59:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 20:59:21,370 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59 [2018-01-28 20:59:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:21,372 INFO L225 Difference]: With dead ends: 141 [2018-01-28 20:59:21,373 INFO L226 Difference]: Without dead ends: 140 [2018-01-28 20:59:21,374 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=609, Invalid=4789, Unknown=4, NotChecked=0, Total=5402 [2018-01-28 20:59:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-28 20:59:21,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-01-28 20:59:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-28 20:59:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-28 20:59:21,388 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-01-28 20:59:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:21,388 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-28 20:59:21,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-28 20:59:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-28 20:59:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 20:59:21,389 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:21,389 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:21,390 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1279257240, now seen corresponding path program 2 times [2018-01-28 20:59:21,390 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:21,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:21,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:21,391 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:21,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:21,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:22,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:22,226 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:22,234 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:59:22,253 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:22,262 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:22,265 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:22,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:22,278 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-28 20:59:22,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,309 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-28 20:59:22,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 20:59:22,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:22,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:22,375 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-28 20:59:22,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,382 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-28 20:59:22,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 20:59:22,433 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-28 20:59:22,434 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-28 20:59:22,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,440 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-28 20:59:22,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 20:59:22,478 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 27 treesize of output 28 [2018-01-28 20:59:22,480 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-28 20:59:22,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:22,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 20:59:22,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-28 20:59:22,932 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 34 treesize of output 33 [2018-01-28 20:59:22,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-28 20:59:22,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:22,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:22,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-28 20:59:22,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:59 [2018-01-28 20:59:23,166 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 22 treesize of output 18 [2018-01-28 20:59:23,172 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 18 treesize of output 15 [2018-01-28 20:59:23,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:23,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:23,185 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-28 20:59:23,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-28 20:59:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:23,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:23,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-28 20:59:23,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 20:59:23,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 20:59:23,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 20:59:23,281 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-01-28 20:59:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:25,705 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-28 20:59:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 20:59:25,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-01-28 20:59:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:25,706 INFO L225 Difference]: With dead ends: 155 [2018-01-28 20:59:25,706 INFO L226 Difference]: Without dead ends: 154 [2018-01-28 20:59:25,707 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=293, Invalid=3129, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 20:59:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-28 20:59:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2018-01-28 20:59:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-28 20:59:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-01-28 20:59:25,719 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-01-28 20:59:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:25,720 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-01-28 20:59:25,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 20:59:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-01-28 20:59:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 20:59:25,721 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:25,721 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:25,721 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1002268754, now seen corresponding path program 2 times [2018-01-28 20:59:25,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:25,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:25,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:25,722 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:25,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:25,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:26,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:26,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:26,392 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:59:26,411 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:26,422 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:26,435 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:26,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:26,471 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-28 20:59:26,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,487 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-28 20:59:26,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-28 20:59:26,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:26,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:26,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-28 20:59:26,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:26,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:26,741 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-28 20:59:26,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:26,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-28 20:59:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:27,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:27,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-01-28 20:59:27,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-28 20:59:27,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-28 20:59:27,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 20:59:27,358 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 47 states. [2018-01-28 20:59:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:29,053 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-01-28 20:59:29,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 20:59:29,053 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-01-28 20:59:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:29,054 INFO L225 Difference]: With dead ends: 165 [2018-01-28 20:59:29,054 INFO L226 Difference]: Without dead ends: 164 [2018-01-28 20:59:29,055 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2018-01-28 20:59:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-28 20:59:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-01-28 20:59:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-28 20:59:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-28 20:59:29,065 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-01-28 20:59:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:29,065 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-28 20:59:29,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-28 20:59:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-28 20:59:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 20:59:29,066 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:29,066 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:29,066 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 260031442, now seen corresponding path program 2 times [2018-01-28 20:59:29,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:29,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:29,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:29,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:29,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:29,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:29,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:29,760 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:29,765 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 20:59:29,779 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:29,786 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:29,788 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:29,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:29,859 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-28 20:59:29,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:29,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:29,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-01-28 20:59:29,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:29,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:29,936 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-28 20:59:29,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:29,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 20:59:29,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:29,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:29,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-01-28 20:59:30,022 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-28 20:59:30,024 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-28 20:59:30,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:30,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:30,033 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-28 20:59:30,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-28 20:59:30,080 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-28 20:59:30,081 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-28 20:59:30,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:30,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:30,095 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-28 20:59:30,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-28 20:59:31,061 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 34 treesize of output 30 [2018-01-28 20:59:31,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 20:59:31,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:31,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 20:59:31,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:31,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:31,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:31,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-01-28 20:59:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:31,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:31,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2018-01-28 20:59:31,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-28 20:59:31,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-28 20:59:31,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2713, Unknown=0, NotChecked=0, Total=2862 [2018-01-28 20:59:31,309 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 54 states. [2018-01-28 20:59:32,819 WARN L146 SmtUtils]: Spent 716ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-01-28 20:59:33,713 WARN L146 SmtUtils]: Spent 812ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-01-28 20:59:34,629 WARN L146 SmtUtils]: Spent 842ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-01-28 20:59:34,847 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 93 DAG size of output 84 [2018-01-28 20:59:35,015 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 91 DAG size of output 82 [2018-01-28 20:59:36,570 WARN L146 SmtUtils]: Spent 1481ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-01-28 20:59:37,906 WARN L146 SmtUtils]: Spent 1249ms on a formula simplification. DAG size of input: 112 DAG size of output 97 [2018-01-28 20:59:38,088 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-01-28 20:59:39,262 WARN L146 SmtUtils]: Spent 996ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-01-28 20:59:41,344 WARN L146 SmtUtils]: Spent 1981ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-01-28 20:59:41,537 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-01-28 20:59:42,224 WARN L146 SmtUtils]: Spent 610ms on a formula simplification. DAG size of input: 111 DAG size of output 98 [2018-01-28 20:59:43,311 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 91 DAG size of output 83 [2018-01-28 20:59:43,966 WARN L146 SmtUtils]: Spent 600ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-01-28 20:59:44,210 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-28 20:59:45,107 WARN L146 SmtUtils]: Spent 646ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-28 20:59:45,521 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 114 DAG size of output 98 [2018-01-28 20:59:45,764 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 115 DAG size of output 100 [2018-01-28 20:59:46,523 WARN L146 SmtUtils]: Spent 666ms on a formula simplification. DAG size of input: 132 DAG size of output 114 [2018-01-28 20:59:46,816 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 109 DAG size of output 98 [2018-01-28 20:59:47,218 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 117 DAG size of output 103 [2018-01-28 20:59:47,878 WARN L146 SmtUtils]: Spent 592ms on a formula simplification. DAG size of input: 83 DAG size of output 77 [2018-01-28 20:59:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:59:48,774 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2018-01-28 20:59:48,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-28 20:59:48,774 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2018-01-28 20:59:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:59:48,775 INFO L225 Difference]: With dead ends: 184 [2018-01-28 20:59:48,775 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 20:59:48,777 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=855, Invalid=8847, Unknown=0, NotChecked=0, Total=9702 [2018-01-28 20:59:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 20:59:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2018-01-28 20:59:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-28 20:59:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-28 20:59:48,791 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-01-28 20:59:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:59:48,791 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-28 20:59:48,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-28 20:59:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-28 20:59:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 20:59:48,792 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:59:48,792 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:59:48,793 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:59:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash -56058392, now seen corresponding path program 5 times [2018-01-28 20:59:48,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:59:48,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:59:48,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:48,794 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 20:59:48,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:59:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:59:48,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:59:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:49,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:59:49,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:59:49,977 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-28 20:59:49,983 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,985 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,987 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,988 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,990 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,996 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 20:59:49,999 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 20:59:50,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:59:50,005 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-28 20:59:50,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:50,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:50,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-28 20:59:50,059 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-28 20:59:50,061 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-28 20:59:50,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:59:50,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:59:50,067 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-28 20:59:50,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 20:59:52,809 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 48 treesize of output 38 [2018-01-28 20:59:52,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 20:59:52,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-01-28 20:59:52,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:59:52,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:59:52,872 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-28 20:59:52,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-28 20:59:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:59:53,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:59:53,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2018-01-28 20:59:53,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-28 20:59:53,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-28 20:59:53,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2536, Unknown=3, NotChecked=0, Total=2756 [2018-01-28 20:59:53,165 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 53 states. [2018-01-28 20:59:54,267 WARN L146 SmtUtils]: Spent 769ms on a formula simplification. DAG size of input: 73 DAG size of output 34 [2018-01-28 20:59:54,840 WARN L146 SmtUtils]: Spent 509ms on a formula simplification. DAG size of input: 101 DAG size of output 45 [2018-01-28 20:59:55,130 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 87 DAG size of output 48 [2018-01-28 20:59:56,274 WARN L146 SmtUtils]: Spent 909ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-01-28 20:59:57,895 WARN L146 SmtUtils]: Spent 947ms on a formula simplification. DAG size of input: 92 DAG size of output 53 [2018-01-28 20:59:59,171 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 98 DAG size of output 59 [2018-01-28 21:00:00,378 WARN L146 SmtUtils]: Spent 1093ms on a formula simplification. DAG size of input: 100 DAG size of output 61 [2018-01-28 21:00:02,144 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 45 [2018-01-28 21:00:03,823 WARN L146 SmtUtils]: Spent 1395ms on a formula simplification. DAG size of input: 84 DAG size of output 43 [2018-01-28 21:00:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:04,756 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-01-28 21:00:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-28 21:00:04,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 66 [2018-01-28 21:00:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:04,757 INFO L225 Difference]: With dead ends: 199 [2018-01-28 21:00:04,757 INFO L226 Difference]: Without dead ends: 198 [2018-01-28 21:00:04,759 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=890, Invalid=7663, Unknown=3, NotChecked=0, Total=8556 [2018-01-28 21:00:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-28 21:00:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2018-01-28 21:00:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-28 21:00:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-01-28 21:00:04,777 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 66 [2018-01-28 21:00:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:04,777 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-01-28 21:00:04,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-28 21:00:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-01-28 21:00:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 21:00:04,778 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:04,778 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:04,778 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -191613235, now seen corresponding path program 1 times [2018-01-28 21:00:04,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:04,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:04,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:04,780 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:04,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:04,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:00:05,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:05,592 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:05,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:00:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:05,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:05,622 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-28 21:00:05,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,626 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-28 21:00:05,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:00:05,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:05,637 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-28 21:00:05,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:05,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:05,645 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-28 21:00:05,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:00:05,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-28 21:00:05,694 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 12 treesize of output 11 [2018-01-28 21:00:05,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-28 21:00:05,725 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 26 treesize of output 27 [2018-01-28 21:00:05,726 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-28 21:00:05,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:05,734 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-28 21:00:05,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-28 21:00:06,100 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 33 treesize of output 32 [2018-01-28 21:00:06,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-28 21:00:06,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:06,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:06,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 21:00:06,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-01-28 21:00:06,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 21:00:06,256 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 17 treesize of output 14 [2018-01-28 21:00:06,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:06,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:06,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:06,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-28 21:00:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:00:06,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:06,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2018-01-28 21:00:06,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 21:00:06,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 21:00:06,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 21:00:06,361 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 39 states. [2018-01-28 21:00:07,259 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 71 DAG size of output 47 [2018-01-28 21:00:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:08,907 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-01-28 21:00:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:00:08,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2018-01-28 21:00:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:08,908 INFO L225 Difference]: With dead ends: 196 [2018-01-28 21:00:08,908 INFO L226 Difference]: Without dead ends: 195 [2018-01-28 21:00:08,909 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=300, Invalid=3240, Unknown=0, NotChecked=0, Total=3540 [2018-01-28 21:00:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-28 21:00:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 185. [2018-01-28 21:00:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:00:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-28 21:00:08,924 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 68 [2018-01-28 21:00:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:08,924 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-28 21:00:08,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 21:00:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-28 21:00:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:00:08,925 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:08,925 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:08,925 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1645043011, now seen corresponding path program 3 times [2018-01-28 21:00:08,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:08,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:08,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:08,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:00:08,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:08,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:09,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:09,481 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:09,486 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:00:09,499 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:09,505 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:09,511 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:09,513 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:09,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:09,520 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-28 21:00:09,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,548 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-28 21:00:09,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-28 21:00:09,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:09,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:09,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-28 21:00:09,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:09,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:09,630 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-28 21:00:09,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:09,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-28 21:00:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:10,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:10,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2018-01-28 21:00:10,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-28 21:00:10,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-28 21:00:10,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2422, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 21:00:10,541 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 51 states. [2018-01-28 21:00:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:15,271 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-01-28 21:00:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-28 21:00:15,272 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-01-28 21:00:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:15,273 INFO L225 Difference]: With dead ends: 233 [2018-01-28 21:00:15,273 INFO L226 Difference]: Without dead ends: 232 [2018-01-28 21:00:15,274 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=878, Invalid=8628, Unknown=0, NotChecked=0, Total=9506 [2018-01-28 21:00:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-28 21:00:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-01-28 21:00:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:00:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-28 21:00:15,297 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-01-28 21:00:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:15,297 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-28 21:00:15,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-28 21:00:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-28 21:00:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 21:00:15,298 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:15,299 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:15,299 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash 428521848, now seen corresponding path program 3 times [2018-01-28 21:00:15,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:15,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:15,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:15,300 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:15,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:15,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:00:15,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:15,811 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:15,816 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:00:15,828 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:15,833 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:15,838 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:15,843 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:00:15,846 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:15,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:15,855 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-28 21:00:15,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 21:00:15,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:00:15,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:15,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:15,916 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-28 21:00:15,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,922 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-28 21:00:15,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:00:15,971 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-28 21:00:15,973 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-28 21:00:15,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:15,979 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-28 21:00:15,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:00:16,013 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 27 treesize of output 28 [2018-01-28 21:00:16,023 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-28 21:00:16,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:16,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:16,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:00:16,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-28 21:00:16,408 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 34 treesize of output 33 [2018-01-28 21:00:16,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-28 21:00:16,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:16,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:16,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 21:00:16,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-01-28 21:00:16,581 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 23 treesize of output 24 [2018-01-28 21:00:16,582 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-28 21:00:16,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:16,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:16,589 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-28 21:00:16,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:00:16,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 21:00:16,665 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 17 treesize of output 14 [2018-01-28 21:00:16,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:16,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:16,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:16,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-28 21:00:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 21:00:16,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:16,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2018-01-28 21:00:16,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 21:00:16,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 21:00:16,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 21:00:16,767 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 42 states. [2018-01-28 21:00:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:18,518 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2018-01-28 21:00:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 21:00:18,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 72 [2018-01-28 21:00:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:18,519 INFO L225 Difference]: With dead ends: 227 [2018-01-28 21:00:18,519 INFO L226 Difference]: Without dead ends: 186 [2018-01-28 21:00:18,520 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=630, Invalid=4200, Unknown=0, NotChecked=0, Total=4830 [2018-01-28 21:00:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-28 21:00:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-01-28 21:00:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:00:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-28 21:00:18,534 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-28 21:00:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:18,534 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-28 21:00:18,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-28 21:00:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-28 21:00:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 21:00:18,535 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:18,535 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:18,535 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1615270521, now seen corresponding path program 4 times [2018-01-28 21:00:18,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:18,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:18,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:18,536 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:18,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:18,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:18,895 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 36 DAG size of output 26 [2018-01-28 21:00:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:19,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:19,730 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:19,736 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-28 21:00:19,761 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:19,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:19,863 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-28 21:00:19,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:19,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:19,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-28 21:00:19,932 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-28 21:00:19,933 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-28 21:00:19,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:19,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:19,939 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-28 21:00:19,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 21:00:20,568 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 38 treesize of output 30 [2018-01-28 21:00:20,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:20,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:20,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:20,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-01-28 21:00:20,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:20,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:20,613 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-28 21:00:20,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-28 21:00:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:20,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:20,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 56 [2018-01-28 21:00:20,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-28 21:00:20,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-28 21:00:20,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=3050, Unknown=0, NotChecked=0, Total=3192 [2018-01-28 21:00:20,972 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 57 states. [2018-01-28 21:00:22,111 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 85 DAG size of output 82 [2018-01-28 21:00:22,490 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 84 DAG size of output 83 [2018-01-28 21:00:22,880 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 102 DAG size of output 100 [2018-01-28 21:00:23,303 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 106 DAG size of output 104 [2018-01-28 21:00:24,090 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 90 DAG size of output 87 [2018-01-28 21:00:24,367 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 87 DAG size of output 85 [2018-01-28 21:00:24,611 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 85 DAG size of output 83 [2018-01-28 21:00:26,004 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-01-28 21:00:26,206 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 92 DAG size of output 91 [2018-01-28 21:00:26,436 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 111 DAG size of output 106 [2018-01-28 21:00:26,807 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 90 DAG size of output 85 [2018-01-28 21:00:27,161 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-28 21:00:27,397 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 93 DAG size of output 87 [2018-01-28 21:00:27,651 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-01-28 21:00:27,855 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 100 DAG size of output 93 [2018-01-28 21:00:28,043 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-01-28 21:00:28,532 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 88 DAG size of output 85 [2018-01-28 21:00:29,061 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 87 DAG size of output 81 [2018-01-28 21:00:30,161 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-01-28 21:00:31,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:31,315 INFO L93 Difference]: Finished difference Result 219 states and 230 transitions. [2018-01-28 21:00:31,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-28 21:00:31,315 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 72 [2018-01-28 21:00:31,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:31,316 INFO L225 Difference]: With dead ends: 219 [2018-01-28 21:00:31,316 INFO L226 Difference]: Without dead ends: 218 [2018-01-28 21:00:31,317 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2687 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=925, Invalid=10415, Unknown=2, NotChecked=0, Total=11342 [2018-01-28 21:00:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-28 21:00:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2018-01-28 21:00:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:00:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-28 21:00:31,332 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-28 21:00:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:31,332 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-28 21:00:31,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-28 21:00:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-28 21:00:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-28 21:00:31,333 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:31,333 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:31,333 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:31,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1251612174, now seen corresponding path program 5 times [2018-01-28 21:00:31,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:31,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:31,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:31,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:31,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:31,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:32,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:32,043 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:32,048 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-28 21:00:32,059 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:00:32,064 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:00:32,075 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:00:32,079 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:32,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:32,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:00:32,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,098 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-28 21:00:32,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-28 21:00:32,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:32,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:32,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-28 21:00:32,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:32,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:32,194 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-28 21:00:32,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-28 21:00:32,272 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-28 21:00:32,273 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-28 21:00:32,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:32,281 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-28 21:00:32,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-28 21:00:32,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-28 21:00:32,491 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 15 [2018-01-28 21:00:32,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:32,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:32,511 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-28 21:00:32,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:45 [2018-01-28 21:00:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:33,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:33,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 58 [2018-01-28 21:00:33,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-28 21:00:33,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-28 21:00:33,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3253, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:00:33,279 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 59 states. [2018-01-28 21:00:34,123 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 80 DAG size of output 66 [2018-01-28 21:00:34,380 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 89 DAG size of output 73 [2018-01-28 21:00:35,842 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 90 DAG size of output 71 [2018-01-28 21:00:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:39,167 INFO L93 Difference]: Finished difference Result 230 states and 242 transitions. [2018-01-28 21:00:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-28 21:00:39,167 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-01-28 21:00:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:39,168 INFO L225 Difference]: With dead ends: 230 [2018-01-28 21:00:39,168 INFO L226 Difference]: Without dead ends: 229 [2018-01-28 21:00:39,170 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=964, Invalid=10808, Unknown=0, NotChecked=0, Total=11772 [2018-01-28 21:00:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-28 21:00:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 185. [2018-01-28 21:00:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-28 21:00:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-28 21:00:39,195 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 76 [2018-01-28 21:00:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:39,196 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-28 21:00:39,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-28 21:00:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-28 21:00:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-28 21:00:39,197 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:39,197 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:39,197 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash 160836131, now seen corresponding path program 2 times [2018-01-28 21:00:39,198 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:39,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:39,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:39,199 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:39,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:39,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 21:00:39,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:39,739 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:39,743 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:00:39,756 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:00:39,765 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:00:39,769 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:39,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:39,774 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-28 21:00:39,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,779 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-28 21:00:39,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:00:39,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:39,837 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-28 21:00:39,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:39,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:39,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-28 21:00:39,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:00:39,899 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-28 21:00:39,901 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-28 21:00:39,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,908 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-28 21:00:39,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:00:39,947 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 27 treesize of output 28 [2018-01-28 21:00:39,954 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-28 21:00:39,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:39,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:00:39,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-28 21:00:40,550 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 34 treesize of output 33 [2018-01-28 21:00:40,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-28 21:00:40,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:40,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:40,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-28 21:00:40,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:63 [2018-01-28 21:00:40,895 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 24 treesize of output 25 [2018-01-28 21:00:40,897 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-28 21:00:40,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:40,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:40,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:00:40,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-28 21:00:41,060 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 22 treesize of output 18 [2018-01-28 21:00:41,108 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 18 treesize of output 15 [2018-01-28 21:00:41,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:00:41,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:41,151 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-28 21:00:41,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-28 21:00:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:00:41,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:41,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2018-01-28 21:00:41,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-28 21:00:41,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-28 21:00:41,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2355, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 21:00:41,372 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 51 states. [2018-01-28 21:00:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:00:50,282 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-28 21:00:50,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-28 21:00:50,283 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2018-01-28 21:00:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:00:50,283 INFO L225 Difference]: With dead ends: 195 [2018-01-28 21:00:50,283 INFO L226 Difference]: Without dead ends: 150 [2018-01-28 21:00:50,284 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=961, Invalid=6695, Unknown=0, NotChecked=0, Total=7656 [2018-01-28 21:00:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-28 21:00:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-01-28 21:00:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 21:00:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-28 21:00:50,300 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-28 21:00:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:00:50,301 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-28 21:00:50,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-28 21:00:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-28 21:00:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-28 21:00:50,301 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:00:50,301 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:00:50,301 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:00:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1882956238, now seen corresponding path program 6 times [2018-01-28 21:00:50,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:00:50,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:00:50,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:50,302 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:00:50,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:00:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:00:50,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:00:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:52,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:00:52,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:00:52,027 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-28 21:00:52,047 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:00:52,051 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:00:52,056 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:00:52,065 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:00:52,070 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-28 21:00:52,075 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:00:52,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:00:52,082 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-28 21:00:52,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,091 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-28 21:00:52,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-28 21:00:52,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:52,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:52,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-28 21:00:52,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:52,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:00:52,183 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-28 21:00:52,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-28 21:00:52,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-28 21:00:52,267 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-28 21:00:52,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:00:52,274 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-28 21:00:52,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-28 21:00:55,099 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 26 [2018-01-28 21:00:55,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 58 [2018-01-28 21:00:55,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-28 21:00:55,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:00:55,182 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-28 21:00:55,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:150 [2018-01-28 21:00:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 58 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:00:56,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:00:56,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2018-01-28 21:00:56,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-28 21:00:56,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-28 21:00:56,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4334, Unknown=1, NotChecked=0, Total=4556 [2018-01-28 21:00:56,076 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 68 states. [2018-01-28 21:00:57,922 WARN L146 SmtUtils]: Spent 782ms on a formula simplification. DAG size of input: 117 DAG size of output 82 [2018-01-28 21:00:58,484 WARN L146 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 128 DAG size of output 83 [2018-01-28 21:00:58,841 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 134 DAG size of output 83 [2018-01-28 21:00:59,109 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 123 DAG size of output 81 [2018-01-28 21:00:59,471 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 146 DAG size of output 98 [2018-01-28 21:01:00,190 WARN L146 SmtUtils]: Spent 558ms on a formula simplification. DAG size of input: 165 DAG size of output 102 [2018-01-28 21:01:00,630 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 141 DAG size of output 84 [2018-01-28 21:01:01,013 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 146 DAG size of output 86 [2018-01-28 21:01:01,256 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 140 DAG size of output 83 [2018-01-28 21:01:01,496 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 138 DAG size of output 81 [2018-01-28 21:01:01,813 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 162 DAG size of output 97 [2018-01-28 21:01:04,764 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 139 DAG size of output 110 [2018-01-28 21:01:05,048 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 123 DAG size of output 106 [2018-01-28 21:01:06,745 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 140 DAG size of output 113 Received shutdown request... [2018-01-28 21:01:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:01:08,793 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:01:08,797 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:01:08,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:01:08 BoogieIcfgContainer [2018-01-28 21:01:08,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:01:08,798 INFO L168 Benchmark]: Toolchain (without parser) took 139157.30 ms. Allocated memory was 306.2 MB in the beginning and 564.1 MB in the end (delta: 257.9 MB). Free memory was 266.2 MB in the beginning and 443.3 MB in the end (delta: -177.1 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:08,799 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:01:08,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.69 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:08,799 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:08,799 INFO L168 Benchmark]: RCFGBuilder took 312.17 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 232.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:08,799 INFO L168 Benchmark]: TraceAbstraction took 138595.83 ms. Allocated memory was 306.2 MB in the beginning and 564.1 MB in the end (delta: 257.9 MB). Free memory was 231.5 MB in the beginning and 443.3 MB in the end (delta: -211.8 MB). Peak memory consumption was 46.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:01:08,801 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.17 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.69 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.54 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 312.17 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 232.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 138595.83 ms. Allocated memory was 306.2 MB in the beginning and 564.1 MB in the end (delta: 257.9 MB). Free memory was 231.5 MB in the beginning and 443.3 MB in the end (delta: -211.8 MB). Peak memory consumption was 46.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 26 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 89 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 11 error locations. TIMEOUT Result, 138.5s OverallTime, 33 OverallIterations, 6 TraceHistogramMax, 96.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1969 SDtfs, 7164 SDslu, 26626 SDs, 0 SdLazy, 19872 SolverSat, 986 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2319 GetRequests, 883 SyntacticMatches, 27 SemanticMatches, 1408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22039 ImplicationChecksByTransitivity, 97.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 396 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 38.8s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2857 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 2824 ConstructedInterpolants, 269 QuantifiedInterpolants, 2300558 SizeOfPredicates, 553 NumberOfNonLiveVariables, 3760 ConjunctsInSsa, 1120 ConjunctsInUnsatCore, 53 InterpolantComputations, 14 PerfectInterpolantSequences, 64/1146 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-01-08-810.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-01-08-810.csv Completed graceful shutdown