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-1cceb4a [2018-01-29 22:34:15,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:34:15,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:34:15,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:34:15,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:34:15,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:34:15,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:34:15,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:34:15,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:34:15,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:34:15,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:34:15,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:34:15,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:34:15,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:34:15,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:34:15,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:34:15,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:34:15,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:34:15,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:34:15,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:34:15,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:34:15,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:34:15,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:34:15,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:34:15,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:34:15,308 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:34:15,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:34:15,309 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:34:15,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:34:15,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:34:15,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:34:15,310 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-29 22:34:15,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:34:15,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:34:15,320 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:34:15,320 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:34:15,320 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:34:15,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:34:15,320 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:34:15,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:34:15,321 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:34:15,321 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:34:15,321 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:34:15,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:34:15,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:34:15,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:34:15,322 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:34:15,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:34:15,323 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:34:15,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:34:15,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:34:15,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:34:15,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:34:15,325 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:34:15,325 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:34:15,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:34:15,367 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:34:15,370 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:34:15,371 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:34:15,371 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:34:15,372 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-29 22:34:15,523 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:34:15,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:34:15,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:34:15,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:34:15,533 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:34:15,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15, skipping insertion in model container [2018-01-29 22:34:15,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,551 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:34:15,590 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:34:15,711 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:34:15,731 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:34:15,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15 WrapperNode [2018-01-29 22:34:15,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:34:15,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:34:15,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:34:15,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:34:15,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (1/1) ... [2018-01-29 22:34:15,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:34:15,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:34:15,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:34:15,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:34:15,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (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-29 22:34:15,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:34:15,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:34:15,829 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-29 22:34:15,829 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:34:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:34:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:34:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:34:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:34:15,829 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:34:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:34:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-29 22:34:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:34:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:34:15,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:34:16,060 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:34:16,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:34:16 BoogieIcfgContainer [2018-01-29 22:34:16,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:34:16,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:34:16,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:34:16,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:34:16,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:34:15" (1/3) ... [2018-01-29 22:34:16,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472eee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:34:16, skipping insertion in model container [2018-01-29 22:34:16,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:34:15" (2/3) ... [2018-01-29 22:34:16,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472eee91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:34:16, skipping insertion in model container [2018-01-29 22:34:16,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:34:16" (3/3) ... [2018-01-29 22:34:16,068 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:34:16,076 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:34:16,082 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-29 22:34:16,125 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:34:16,125 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:34:16,125 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:34:16,125 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:34:16,126 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:34:16,126 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:34:16,126 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:34:16,126 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:34:16,127 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:34:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-29 22:34:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 22:34:16,153 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:16,154 INFO L350 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-29 22:34:16,154 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1358649906, now seen corresponding path program 1 times [2018-01-29 22:34:16,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:16,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:16,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:16,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:16,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:16,313 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-29 22:34:16,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:16,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:34:16,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:34:16,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:34:16,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:34:16,332 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-01-29 22:34:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:16,528 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-29 22:34:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:34:16,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-29 22:34:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:16,542 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:34:16,543 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:34:16,546 INFO L553 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-29 22:34:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:34:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-29 22:34:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 22:34:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-29 22:34:16,590 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-01-29 22:34:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:16,591 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-29 22:34:16,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:34:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-29 22:34:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:34:16,592 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:16,592 INFO L350 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-29 22:34:16,592 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 291143110, now seen corresponding path program 1 times [2018-01-29 22:34:16,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:16,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:16,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:16,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:16,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:16,698 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-29 22:34:16,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:16,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:34:16,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:34:16,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:34:16,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:34:16,701 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-01-29 22:34:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:16,768 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-29 22:34:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:34:16,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 22:34:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:16,771 INFO L225 Difference]: With dead ends: 75 [2018-01-29 22:34:16,771 INFO L226 Difference]: Without dead ends: 74 [2018-01-29 22:34:16,772 INFO L553 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-29 22:34:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-29 22:34:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-29 22:34:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-29 22:34:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-29 22:34:16,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-29 22:34:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:16,781 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-29 22:34:16,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:34:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-29 22:34:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:34:16,783 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:16,783 INFO L350 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-29 22:34:16,783 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash 291143111, now seen corresponding path program 1 times [2018-01-29 22:34:16,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:16,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:16,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:16,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:16,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:16,995 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-29 22:34:16,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:16,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:34:16,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:34:16,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:34:16,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:34:16,997 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-01-29 22:34:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:17,091 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-29 22:34:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:34:17,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-29 22:34:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:17,093 INFO L225 Difference]: With dead ends: 74 [2018-01-29 22:34:17,094 INFO L226 Difference]: Without dead ends: 73 [2018-01-29 22:34:17,094 INFO L553 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-29 22:34:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-29 22:34:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-29 22:34:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 22:34:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-29 22:34:17,101 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-01-29 22:34:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:17,102 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-29 22:34:17,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:34:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-29 22:34:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:34:17,103 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:17,103 INFO L350 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-29 22:34:17,103 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash 435501890, now seen corresponding path program 1 times [2018-01-29 22:34:17,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:17,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:17,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:17,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:17,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:17,154 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-29 22:34:17,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:17,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:34:17,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:34:17,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:34:17,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:34:17,156 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-01-29 22:34:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:17,223 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-29 22:34:17,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:34:17,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 22:34:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:17,225 INFO L225 Difference]: With dead ends: 73 [2018-01-29 22:34:17,225 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 22:34:17,226 INFO L553 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-29 22:34:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 22:34:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-29 22:34:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:34:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-29 22:34:17,232 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-01-29 22:34:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:17,233 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-29 22:34:17,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:34:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-29 22:34:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:34:17,234 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:17,234 INFO L350 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-29 22:34:17,234 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 435501891, now seen corresponding path program 1 times [2018-01-29 22:34:17,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:17,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:17,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:17,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:17,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:17,365 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-29 22:34:17,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:17,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:34:17,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:34:17,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:34:17,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:34:17,366 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 7 states. [2018-01-29 22:34:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:17,493 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-29 22:34:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:34:17,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-29 22:34:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:17,494 INFO L225 Difference]: With dead ends: 72 [2018-01-29 22:34:17,494 INFO L226 Difference]: Without dead ends: 71 [2018-01-29 22:34:17,495 INFO L553 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-29 22:34:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-29 22:34:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-29 22:34:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 22:34:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-29 22:34:17,503 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-29 22:34:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:17,504 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-29 22:34:17,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:34:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-29 22:34:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:34:17,505 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:17,505 INFO L350 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-29 22:34:17,505 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353202, now seen corresponding path program 1 times [2018-01-29 22:34:17,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:17,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:17,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:17,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:17,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:17,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-29 22:34:17,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:17,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:34:17,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:34:17,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:34:17,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:34:17,573 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-01-29 22:34:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:17,693 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-29 22:34:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:34:17,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-29 22:34:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:17,709 INFO L225 Difference]: With dead ends: 78 [2018-01-29 22:34:17,709 INFO L226 Difference]: Without dead ends: 77 [2018-01-29 22:34:17,710 INFO L553 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-29 22:34:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-29 22:34:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-01-29 22:34:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 22:34:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-29 22:34:17,716 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-01-29 22:34:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:17,717 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-29 22:34:17,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:34:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-29 22:34:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:34:17,718 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:17,718 INFO L350 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-29 22:34:17,718 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353203, now seen corresponding path program 1 times [2018-01-29 22:34:17,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:17,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:17,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:17,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:17,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:17,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:17,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:34:17,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:34:17,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:34:17,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:34:17,858 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-29 22:34:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:18,058 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-29 22:34:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:34:18,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-29 22:34:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:18,059 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:34:18,060 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:34:18,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:34:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:34:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-01-29 22:34:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 22:34:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-29 22:34:18,067 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-01-29 22:34:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:18,068 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-29 22:34:18,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:34:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-29 22:34:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:34:18,069 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:18,069 INFO L350 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-29 22:34:18,070 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -789761369, now seen corresponding path program 1 times [2018-01-29 22:34:18,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:18,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:18,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:18,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:18,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:18,152 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-29 22:34:18,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:18,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:34:18,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:34:18,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:34:18,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:34:18,154 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-01-29 22:34:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:18,253 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-29 22:34:18,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:34:18,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-29 22:34:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:18,255 INFO L225 Difference]: With dead ends: 76 [2018-01-29 22:34:18,255 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:34:18,255 INFO L553 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-29 22:34:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:34:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-01-29 22:34:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:34:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-29 22:34:18,263 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-01-29 22:34:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:18,263 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-29 22:34:18,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:34:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-29 22:34:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:34:18,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:18,265 INFO L350 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-29 22:34:18,265 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash -789761368, now seen corresponding path program 1 times [2018-01-29 22:34:18,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:18,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:18,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:18,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:18,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:18,385 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-29 22:34:18,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:18,385 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-29 22:34:18,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:18,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:18,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-29 22:34:18,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:18,498 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-29 22:34:18,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:34:18,594 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-29 22:34:18,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:18,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-29 22:34:18,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 22:34:18,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 22:34:18,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:34:18,630 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 11 states. [2018-01-29 22:34:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:18,975 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-29 22:34:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:34:18,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-29 22:34:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:18,976 INFO L225 Difference]: With dead ends: 92 [2018-01-29 22:34:18,976 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 22:34:18,977 INFO L553 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-29 22:34:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 22:34:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-29 22:34:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 22:34:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-29 22:34:18,984 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-01-29 22:34:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:18,984 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-29 22:34:18,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 22:34:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-29 22:34:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:34:18,986 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:18,986 INFO L350 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-29 22:34:18,986 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136617, now seen corresponding path program 1 times [2018-01-29 22:34:18,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:18,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:18,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:18,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:18,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:19,059 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-29 22:34:19,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:19,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:34:19,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:34:19,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:34:19,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:34:19,061 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-29 22:34:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:19,145 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-29 22:34:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:34:19,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-29 22:34:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:19,147 INFO L225 Difference]: With dead ends: 79 [2018-01-29 22:34:19,147 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 22:34:19,147 INFO L553 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-29 22:34:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 22:34:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-29 22:34:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 22:34:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-29 22:34:19,154 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-01-29 22:34:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:19,154 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-29 22:34:19,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:34:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-29 22:34:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:34:19,155 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:19,155 INFO L350 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-29 22:34:19,155 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136616, now seen corresponding path program 1 times [2018-01-29 22:34:19,156 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:19,156 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:19,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:19,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:19,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:19,269 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-29 22:34:19,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:19,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:34:19,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:34:19,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:34:19,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:34:19,270 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-01-29 22:34:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:19,377 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-29 22:34:19,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:34:19,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-29 22:34:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:19,378 INFO L225 Difference]: With dead ends: 93 [2018-01-29 22:34:19,378 INFO L226 Difference]: Without dead ends: 92 [2018-01-29 22:34:19,378 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:34:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-29 22:34:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-29 22:34:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:34:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-29 22:34:19,387 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-01-29 22:34:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:19,388 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-29 22:34:19,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:34:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-29 22:34:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:34:19,389 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:19,389 INFO L350 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-29 22:34:19,389 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash 219274321, now seen corresponding path program 1 times [2018-01-29 22:34:19,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:19,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:19,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:19,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:19,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:19,451 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-29 22:34:19,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:19,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:34:19,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:34:19,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:34:19,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:34:19,453 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-01-29 22:34:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:19,583 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-29 22:34:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:34:19,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-29 22:34:19,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:19,584 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:34:19,585 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:34:19,585 INFO L553 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-29 22:34:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:34:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-29 22:34:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 22:34:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-29 22:34:19,591 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-01-29 22:34:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:19,591 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-29 22:34:19,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:34:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-29 22:34:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:34:19,592 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:19,592 INFO L350 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-29 22:34:19,592 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 219274322, now seen corresponding path program 1 times [2018-01-29 22:34:19,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:19,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:19,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:19,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:19,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:19,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-29 22:34:19,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:19,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:34:19,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:34:19,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:34:19,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:34:19,727 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 9 states. [2018-01-29 22:34:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:19,933 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-01-29 22:34:19,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:34:19,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-29 22:34:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:19,935 INFO L225 Difference]: With dead ends: 95 [2018-01-29 22:34:19,935 INFO L226 Difference]: Without dead ends: 94 [2018-01-29 22:34:19,935 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-29 22:34:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-29 22:34:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-29 22:34:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 22:34:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-29 22:34:19,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 40 [2018-01-29 22:34:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:19,941 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-29 22:34:19,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:34:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-29 22:34:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:34:19,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:19,942 INFO L350 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-29 22:34:19,943 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 564346387, now seen corresponding path program 2 times [2018-01-29 22:34:19,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:19,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:19,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:19,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:19,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:20,295 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-29 22:34:20,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:20,295 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-29 22:34:20,302 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:20,315 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:20,320 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:20,321 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:20,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:20,338 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-29 22:34:20,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:20,350 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-29 22:34:20,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:34:20,388 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-29 22:34:20,390 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-29 22:34:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:20,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:20,398 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-29 22:34:20,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:34:20,544 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-29 22:34:20,550 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-29 22:34:20,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:20,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:20,563 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-29 22:34:20,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-29 22:34:20,677 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-29 22:34:20,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:20,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-01-29 22:34:20,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:34:20,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:34:20,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:34:20,699 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 26 states. [2018-01-29 22:34:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:21,570 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-29 22:34:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:34:21,570 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-01-29 22:34:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:21,571 INFO L225 Difference]: With dead ends: 113 [2018-01-29 22:34:21,571 INFO L226 Difference]: Without dead ends: 112 [2018-01-29 22:34:21,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 22:34:21,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-29 22:34:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-01-29 22:34:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:34:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:34:21,580 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2018-01-29 22:34:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:21,581 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:34:21,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:34:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:34:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:34:21,582 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:21,582 INFO L350 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-29 22:34:21,582 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 141736189, now seen corresponding path program 1 times [2018-01-29 22:34:21,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:21,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:21,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:21,584 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:21,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:21,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:21,724 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-29 22:34:21,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:21,724 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-29 22:34:21,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:21,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:21,756 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-29 22:34:21,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:21,761 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-29 22:34:21,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:34:21,852 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-29 22:34:21,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:21,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-01-29 22:34:21,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 22:34:21,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 22:34:21,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-29 22:34:21,873 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 18 states. [2018-01-29 22:34:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:22,113 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-29 22:34:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 22:34:22,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-29 22:34:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:22,114 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:34:22,114 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:34:22,114 INFO L553 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-29 22:34:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:34:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-01-29 22:34:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:34:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:34:22,122 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2018-01-29 22:34:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:22,122 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:34:22,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 22:34:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:34:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:34:22,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:22,123 INFO L350 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-29 22:34:22,123 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -220320392, now seen corresponding path program 1 times [2018-01-29 22:34:22,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:22,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:22,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:22,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:22,522 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-29 22:34:22,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:22,522 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-29 22:34:22,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:22,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:22,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 6 treesize of output 5 [2018-01-29 22:34:22,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:34:22,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:22,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:22,636 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-29 22:34:22,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:34:22,704 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-29 22:34:22,706 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-29 22:34:22,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,714 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-29 22:34:22,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:34:22,762 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-29 22:34:22,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 11 treesize of output 10 [2018-01-29 22:34:22,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:22,794 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-29 22:34:22,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:34:23,030 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-29 22:34:23,037 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-29 22:34:23,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:23,046 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-29 22:34:23,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:23,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:23,061 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-29 22:34:23,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-29 22:34:23,111 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-29 22:34:23,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:23,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-29 22:34:23,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:34:23,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:34:23,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:34:23,132 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 26 states. [2018-01-29 22:34:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:23,954 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-29 22:34:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:34:23,955 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-01-29 22:34:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:23,955 INFO L225 Difference]: With dead ends: 121 [2018-01-29 22:34:23,956 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 22:34:23,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:34:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 22:34:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-01-29 22:34:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:34:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-29 22:34:23,962 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-29 22:34:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:23,962 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-29 22:34:23,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:34:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-29 22:34:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 22:34:23,963 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:23,963 INFO L350 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-29 22:34:23,963 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1760002418, now seen corresponding path program 1 times [2018-01-29 22:34:23,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:23,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:23,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:23,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:23,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:23,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:24,106 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-29 22:34:24,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:24,107 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-29 22:34:24,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:24,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:24,136 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-29 22:34:24,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:24,140 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-29 22:34:24,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:34:24,277 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-29 22:34:24,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:24,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-29 22:34:24,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:34:24,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:34:24,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:34:24,304 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 21 states. [2018-01-29 22:34:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:24,634 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-29 22:34:24,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 22:34:24,634 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-01-29 22:34:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:24,638 INFO L225 Difference]: With dead ends: 138 [2018-01-29 22:34:24,638 INFO L226 Difference]: Without dead ends: 137 [2018-01-29 22:34:24,639 INFO L553 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-29 22:34:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-29 22:34:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-01-29 22:34:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-29 22:34:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-29 22:34:24,646 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 51 [2018-01-29 22:34:24,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:24,646 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-29 22:34:24,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:34:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-29 22:34:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:34:24,647 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:24,647 INFO L350 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-29 22:34:24,647 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash -801598392, now seen corresponding path program 3 times [2018-01-29 22:34:24,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:24,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:24,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:24,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:24,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:24,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:25,105 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-29 22:34:25,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:25,105 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-29 22:34:25,110 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:34:25,121 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:25,125 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:25,128 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:25,133 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:25,135 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:25,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:25,146 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-29 22:34:25,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:25,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-29 22:34:25,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:34:25,195 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-29 22:34:25,197 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-29 22:34:25,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:25,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:25,204 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-29 22:34:25,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:34:25,616 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-29 22:34:25,629 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-29 22:34:25,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-29 22:34:25,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:25,663 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-29 22:34:25,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-29 22:34:25,901 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-29 22:34:25,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:25,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-01-29 22:34:25,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:34:25,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:34:25,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:34:25,922 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 39 states. [2018-01-29 22:34:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:28,109 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-29 22:34:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 22:34:28,110 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-01-29 22:34:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:28,111 INFO L225 Difference]: With dead ends: 149 [2018-01-29 22:34:28,111 INFO L226 Difference]: Without dead ends: 148 [2018-01-29 22:34:28,112 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=484, Invalid=3298, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 22:34:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-29 22:34:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-01-29 22:34:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-29 22:34:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-29 22:34:28,121 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 52 [2018-01-29 22:34:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:28,122 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-29 22:34:28,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:34:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-29 22:34:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:34:28,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:28,122 INFO L350 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-29 22:34:28,122 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash -507124950, now seen corresponding path program 1 times [2018-01-29 22:34:28,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:28,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:28,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:28,123 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:28,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:28,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:28,242 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-29 22:34:28,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:34:28,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:34:28,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:34:28,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:34:28,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:34:28,244 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 6 states. [2018-01-29 22:34:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:28,362 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-29 22:34:28,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:34:28,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-29 22:34:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:28,363 INFO L225 Difference]: With dead ends: 135 [2018-01-29 22:34:28,363 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 22:34:28,364 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:34:28,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 22:34:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-29 22:34:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-29 22:34:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-29 22:34:28,373 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 54 [2018-01-29 22:34:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:28,373 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-29 22:34:28,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:34:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-29 22:34:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:34:28,374 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:28,374 INFO L350 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-29 22:34:28,374 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1728796146, now seen corresponding path program 2 times [2018-01-29 22:34:28,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:28,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:28,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:28,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:28,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:28,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:28,576 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-29 22:34:28,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:28,577 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-29 22:34:28,586 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:28,603 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:28,607 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:28,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:28,678 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-29 22:34:28,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:34:28,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-01-29 22:34:28,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 22:34:28,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 22:34:28,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:34:28,714 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 15 states. [2018-01-29 22:34:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:29,159 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-01-29 22:34:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 22:34:29,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-29 22:34:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:29,160 INFO L225 Difference]: With dead ends: 129 [2018-01-29 22:34:29,160 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 22:34:29,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 22:34:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 22:34:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-01-29 22:34:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 22:34:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-29 22:34:29,168 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 54 [2018-01-29 22:34:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:29,168 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-29 22:34:29,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 22:34:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-29 22:34:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 22:34:29,169 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:29,169 INFO L350 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-29 22:34:29,169 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1598987239, now seen corresponding path program 1 times [2018-01-29 22:34:29,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:29,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:29,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:29,170 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:29,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:29,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:29,554 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-29 22:34:29,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:29,555 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-29 22:34:29,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:29,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:29,587 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-29 22:34:29,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:29,592 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-29 22:34:29,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:29,596 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-29 22:34:29,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:34:29,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:29,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:29,639 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-29 22:34:29,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:29,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:29,646 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-29 22:34:29,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:29,651 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-29 22:34:29,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:34:30,108 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-29 22:34:30,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:30,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-01-29 22:34:30,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 22:34:30,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 22:34:30,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 22:34:30,129 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 43 states. [2018-01-29 22:34:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:32,021 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-01-29 22:34:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 22:34:32,022 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-01-29 22:34:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:32,022 INFO L225 Difference]: With dead ends: 137 [2018-01-29 22:34:32,022 INFO L226 Difference]: Without dead ends: 136 [2018-01-29 22:34:32,024 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=547, Invalid=5003, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 22:34:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-29 22:34:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2018-01-29 22:34:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 22:34:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-29 22:34:32,030 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 58 [2018-01-29 22:34:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:32,030 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-29 22:34:32,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 22:34:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-29 22:34:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 22:34:32,031 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:32,031 INFO L350 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-29 22:34:32,031 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1498101645, now seen corresponding path program 4 times [2018-01-29 22:34:32,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:32,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:32,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:32,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:32,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:32,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:32,688 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-29 22:34:32,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:32,688 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-29 22:34:32,694 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:34:32,710 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:32,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:32,725 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-29 22:34:32,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,737 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-29 22:34:32,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:34:32,782 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-29 22:34:32,783 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-29 22:34:32,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:34:32,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:34:35,906 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-29 22:34:35,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:35,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:35,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:35,931 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-29 22:34:35,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:35,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:35,984 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-29 22:34:35,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-29 22:34:36,242 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-29 22:34:36,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:36,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2018-01-29 22:34:36,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 22:34:36,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 22:34:36,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1888, Unknown=4, NotChecked=0, Total=2070 [2018-01-29 22:34:36,277 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 46 states. [2018-01-29 22:34:37,348 WARN L146 SmtUtils]: Spent 664ms on a formula simplification. DAG size of input: 86 DAG size of output 45 [2018-01-29 22:34:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:40,789 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-01-29 22:34:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 22:34:40,789 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59 [2018-01-29 22:34:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:40,791 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:34:40,791 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 22:34:40,792 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=609, Invalid=4789, Unknown=4, NotChecked=0, Total=5402 [2018-01-29 22:34:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 22:34:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-01-29 22:34:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-29 22:34:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-29 22:34:40,803 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-01-29 22:34:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:40,803 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-29 22:34:40,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 22:34:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-29 22:34:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:34:40,804 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:40,804 INFO L350 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-29 22:34:40,805 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1279257240, now seen corresponding path program 2 times [2018-01-29 22:34:40,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:40,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:40,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:40,806 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:40,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:40,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:41,643 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-29 22:34:41,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:41,644 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-29 22:34:41,659 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:41,674 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:41,681 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:41,683 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:41,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:41,690 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-29 22:34:41,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,715 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-29 22:34:41,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:34:41,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:41,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:41,771 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-29 22:34:41,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,778 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-29 22:34:41,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,782 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-29 22:34:41,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:34:41,830 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-29 22:34:41,831 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-29 22:34:41,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,838 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-29 22:34:41,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:34:41,877 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-29 22:34:41,879 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-29 22:34:41,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:41,889 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-29 22:34:41,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-29 22:34:42,325 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-29 22:34:42,334 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-29 22:34:42,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:42,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:42,372 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-29 22:34:42,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:59 [2018-01-29 22:34:42,561 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-29 22:34:42,567 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-29 22:34:42,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:42,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:42,579 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-29 22:34:42,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:34:42,649 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-29 22:34:42,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:42,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-29 22:34:42,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:34:42,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:34:42,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:34:42,670 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-01-29 22:34:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:44,614 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-29 22:34:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:34:44,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-01-29 22:34:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:44,615 INFO L225 Difference]: With dead ends: 155 [2018-01-29 22:34:44,615 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 22:34:44,616 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=293, Invalid=3129, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 22:34:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 22:34:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2018-01-29 22:34:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-29 22:34:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-01-29 22:34:44,629 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-01-29 22:34:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:44,630 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-01-29 22:34:44,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:34:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-01-29 22:34:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 22:34:44,631 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:44,631 INFO L350 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-29 22:34:44,631 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1002268754, now seen corresponding path program 2 times [2018-01-29 22:34:44,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:44,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:44,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:44,632 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:44,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:44,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:45,262 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-29 22:34:45,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:45,262 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-29 22:34:45,267 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:45,281 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:45,288 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:45,292 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:45,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:45,305 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-29 22:34:45,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:45,310 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-29 22:34:45,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:45,317 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-29 22:34:45,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:34:45,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:45,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:45,384 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-29 22:34:45,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:45,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:45,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:45,395 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-29 22:34:45,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:45,401 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-29 22:34:45,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:34:45,989 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-29 22:34:46,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:46,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-01-29 22:34:46,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 22:34:46,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 22:34:46,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:34:46,010 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 47 states. [2018-01-29 22:34:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:47,652 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-01-29 22:34:47,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:34:47,652 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-01-29 22:34:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:47,653 INFO L225 Difference]: With dead ends: 165 [2018-01-29 22:34:47,653 INFO L226 Difference]: Without dead ends: 164 [2018-01-29 22:34:47,654 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2018-01-29 22:34:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-29 22:34:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-01-29 22:34:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-29 22:34:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-29 22:34:47,664 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-01-29 22:34:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:47,664 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-29 22:34:47,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 22:34:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-29 22:34:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 22:34:47,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:47,665 INFO L350 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-29 22:34:47,665 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:34:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash 260031442, now seen corresponding path program 2 times [2018-01-29 22:34:47,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:47,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:47,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:47,667 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:47,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:47,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:48,313 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-29 22:34:48,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:48,313 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-29 22:34:48,318 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:48,330 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:48,336 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:48,339 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:48,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:48,409 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-29 22:34:48,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-01-29 22:34:48,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:48,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:34:48,484 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-29 22:34:48,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,493 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-29 22:34:48,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,500 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-29 22:34:48,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-01-29 22:34:48,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, 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-29 22:34:48,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-29 22:34:48,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,579 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-29 22:34:48,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-29 22:34:48,625 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-29 22:34:48,627 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-29 22:34:48,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:48,640 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-29 22:34:48,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-29 22:34:49,435 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-29 22:34:49,438 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-29 22:34:49,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:49,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-29 22:34:49,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:49,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:49,464 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-29 22:34:49,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-01-29 22:34:49,618 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-29 22:34:49,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:49,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2018-01-29 22:34:49,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-29 22:34:49,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-29 22:34:49,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2713, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 22:34:49,639 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 54 states. [2018-01-29 22:34:51,110 WARN L146 SmtUtils]: Spent 682ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-01-29 22:34:51,792 WARN L146 SmtUtils]: Spent 613ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-01-29 22:34:52,703 WARN L146 SmtUtils]: Spent 839ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-01-29 22:34:52,928 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 93 DAG size of output 84 [2018-01-29 22:34:53,089 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 91 DAG size of output 82 [2018-01-29 22:34:54,464 WARN L146 SmtUtils]: Spent 1309ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-01-29 22:34:55,770 WARN L146 SmtUtils]: Spent 1219ms on a formula simplification. DAG size of input: 112 DAG size of output 97 [2018-01-29 22:34:55,938 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-01-29 22:34:57,021 WARN L146 SmtUtils]: Spent 969ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-01-29 22:34:59,039 WARN L146 SmtUtils]: Spent 1918ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-01-29 22:34:59,237 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-01-29 22:34:59,913 WARN L146 SmtUtils]: Spent 601ms on a formula simplification. DAG size of input: 111 DAG size of output 98 [2018-01-29 22:35:00,728 WARN L146 SmtUtils]: Spent 591ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-01-29 22:35:00,911 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-29 22:35:01,791 WARN L146 SmtUtils]: Spent 633ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-29 22:35:02,252 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 114 DAG size of output 98 [2018-01-29 22:35:02,506 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 115 DAG size of output 100 [2018-01-29 22:35:03,142 WARN L146 SmtUtils]: Spent 550ms on a formula simplification. DAG size of input: 132 DAG size of output 114 [2018-01-29 22:35:03,333 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 109 DAG size of output 98 [2018-01-29 22:35:03,601 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 117 DAG size of output 103 [2018-01-29 22:35:04,232 WARN L146 SmtUtils]: Spent 575ms on a formula simplification. DAG size of input: 83 DAG size of output 77 [2018-01-29 22:35:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:05,151 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2018-01-29 22:35:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-29 22:35:05,151 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2018-01-29 22:35:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:05,152 INFO L225 Difference]: With dead ends: 184 [2018-01-29 22:35:05,152 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 22:35:05,154 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=855, Invalid=8847, Unknown=0, NotChecked=0, Total=9702 [2018-01-29 22:35:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 22:35:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2018-01-29 22:35:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-29 22:35:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-29 22:35:05,167 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-01-29 22:35:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:05,167 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-29 22:35:05,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-29 22:35:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-29 22:35:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 22:35:05,168 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:05,168 INFO L350 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-29 22:35:05,168 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:05,168 INFO L82 PathProgramCache]: Analyzing trace with hash -56058392, now seen corresponding path program 5 times [2018-01-29 22:35:05,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:05,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:05,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:05,169 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:05,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:05,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:06,775 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-29 22:35:06,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:06,775 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-29 22:35:06,780 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:35:06,786 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,788 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,790 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,791 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,793 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,799 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:06,802 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:06,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:06,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:35:06,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:06,817 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-29 22:35:06,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:35:06,877 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-29 22:35:06,879 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-29 22:35:06,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:06,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:06,887 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-29 22:35:06,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:35:09,487 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-29 22:35:09,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:09,502 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-29 22:35:09,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:09,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:09,555 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-29 22:35:09,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-29 22:35:09,837 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-29 22:35:09,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:09,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2018-01-29 22:35:09,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 22:35:09,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 22:35:09,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2536, Unknown=3, NotChecked=0, Total=2756 [2018-01-29 22:35:09,858 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 53 states. [2018-01-29 22:35:10,935 WARN L146 SmtUtils]: Spent 742ms on a formula simplification. DAG size of input: 73 DAG size of output 34 [2018-01-29 22:35:11,486 WARN L146 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 101 DAG size of output 45 [2018-01-29 22:35:11,771 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 87 DAG size of output 48 [2018-01-29 22:35:12,870 WARN L146 SmtUtils]: Spent 869ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-01-29 22:35:14,334 WARN L146 SmtUtils]: Spent 929ms on a formula simplification. DAG size of input: 92 DAG size of output 53 [2018-01-29 22:35:15,586 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 98 DAG size of output 59 [2018-01-29 22:35:16,526 WARN L146 SmtUtils]: Spent 858ms on a formula simplification. DAG size of input: 100 DAG size of output 61 [2018-01-29 22:35:19,643 WARN L146 SmtUtils]: Spent 1252ms on a formula simplification. DAG size of input: 84 DAG size of output 43 [2018-01-29 22:35:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:20,516 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-01-29 22:35:20,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-29 22:35:20,516 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 66 [2018-01-29 22:35:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:20,518 INFO L225 Difference]: With dead ends: 199 [2018-01-29 22:35:20,518 INFO L226 Difference]: Without dead ends: 198 [2018-01-29 22:35:20,519 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=890, Invalid=7663, Unknown=3, NotChecked=0, Total=8556 [2018-01-29 22:35:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-29 22:35:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2018-01-29 22:35:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-29 22:35:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-01-29 22:35:20,542 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 66 [2018-01-29 22:35:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:20,542 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-01-29 22:35:20,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 22:35:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-01-29 22:35:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 22:35:20,543 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:20,543 INFO L350 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-29 22:35:20,543 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -191613235, now seen corresponding path program 1 times [2018-01-29 22:35:20,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:20,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:20,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:20,545 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:20,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:20,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:21,180 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-29 22:35:21,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:21,210 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-29 22:35:21,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:35:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:21,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:21,241 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-29 22:35:21,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,245 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-29 22:35:21,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:35:21,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:21,256 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-29 22:35:21,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:21,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:21,264 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-29 22:35:21,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,268 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-29 22:35:21,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:35:21,318 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-29 22:35:21,319 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-29 22:35:21,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-29 22:35:21,350 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-29 22:35:21,351 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-29 22:35:21,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:21,359 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-29 22:35:21,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-29 22:35:21,724 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-29 22:35:21,732 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-29 22:35:21,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:21,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:21,757 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-29 22:35:21,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-01-29 22:35:21,878 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-29 22:35:21,883 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-29 22:35:21,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:21,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:21,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:21,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:35:21,964 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-29 22:35:21,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:21,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2018-01-29 22:35:21,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:35:21,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:35:21,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:35:21,985 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 39 states. [2018-01-29 22:35:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:23,950 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-01-29 22:35:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:35:23,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2018-01-29 22:35:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:23,951 INFO L225 Difference]: With dead ends: 196 [2018-01-29 22:35:23,951 INFO L226 Difference]: Without dead ends: 195 [2018-01-29 22:35:23,952 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=300, Invalid=3240, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:35:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-29 22:35:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 185. [2018-01-29 22:35:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:35:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-29 22:35:23,974 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 68 [2018-01-29 22:35:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:23,975 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-29 22:35:23,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:35:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-29 22:35:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:35:23,975 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:23,976 INFO L350 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-29 22:35:23,976 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1645043011, now seen corresponding path program 3 times [2018-01-29 22:35:23,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:23,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:23,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:23,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:35:23,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:23,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:24,561 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-29 22:35:24,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:24,561 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-29 22:35:24,566 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:35:24,579 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:24,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:24,591 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:24,594 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:24,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:24,601 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-29 22:35:24,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:24,613 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-29 22:35:24,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:24,619 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-29 22:35:24,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:35:24,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:24,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:24,671 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-29 22:35:24,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:24,682 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-29 22:35:24,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:24,687 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-29 22:35:24,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:35:25,347 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-29 22:35:25,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:25,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2018-01-29 22:35:25,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-29 22:35:25,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-29 22:35:25,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2422, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 22:35:25,370 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 51 states. [2018-01-29 22:35:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:29,905 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-01-29 22:35:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 22:35:29,905 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-01-29 22:35:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:29,906 INFO L225 Difference]: With dead ends: 233 [2018-01-29 22:35:29,906 INFO L226 Difference]: Without dead ends: 232 [2018-01-29 22:35:29,907 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=878, Invalid=8628, Unknown=0, NotChecked=0, Total=9506 [2018-01-29 22:35:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-29 22:35:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-01-29 22:35:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:35:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-29 22:35:29,922 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-01-29 22:35:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:29,922 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-29 22:35:29,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-29 22:35:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-29 22:35:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 22:35:29,922 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:29,923 INFO L350 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-29 22:35:29,923 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:29,923 INFO L82 PathProgramCache]: Analyzing trace with hash 428521848, now seen corresponding path program 3 times [2018-01-29 22:35:29,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:29,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:29,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:29,924 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:29,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:29,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:30,425 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-29 22:35:30,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:30,425 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-29 22:35:30,430 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:35:30,443 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:30,448 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:30,452 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:30,457 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:35:30,460 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:30,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:30,466 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-29 22:35:30,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,470 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-29 22:35:30,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:35:30,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:30,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:30,517 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-29 22:35:30,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,524 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-29 22:35:30,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,550 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-29 22:35:30,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:35:30,596 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-29 22:35:30,597 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-29 22:35:30,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,603 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-29 22:35:30,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:35:30,637 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-29 22:35:30,639 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-29 22:35:30,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:30,649 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-29 22:35:30,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-29 22:35:30,968 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-29 22:35:30,977 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-29 22:35:30,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:30,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:31,004 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-29 22:35:31,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-01-29 22:35:31,117 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-29 22:35:31,118 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-29 22:35:31,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:31,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:31,126 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-29 22:35:31,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:35:31,190 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-29 22:35:31,195 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-29 22:35:31,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:31,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:31,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:31,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:35:31,268 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-29 22:35:31,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:31,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2018-01-29 22:35:31,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 22:35:31,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 22:35:31,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:35:31,289 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 42 states. [2018-01-29 22:35:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:32,846 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2018-01-29 22:35:32,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:35:32,846 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 72 [2018-01-29 22:35:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:32,847 INFO L225 Difference]: With dead ends: 227 [2018-01-29 22:35:32,847 INFO L226 Difference]: Without dead ends: 186 [2018-01-29 22:35:32,848 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=630, Invalid=4200, Unknown=0, NotChecked=0, Total=4830 [2018-01-29 22:35:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-29 22:35:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-01-29 22:35:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:35:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-29 22:35:32,862 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-29 22:35:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:32,862 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-29 22:35:32,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 22:35:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-29 22:35:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 22:35:32,862 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:32,863 INFO L350 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-29 22:35:32,863 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1615270521, now seen corresponding path program 4 times [2018-01-29 22:35:32,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:32,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:32,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:32,863 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:32,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:32,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:33,618 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-29 22:35:33,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:33,618 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-29 22:35:33,623 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:35:33,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:33,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:33,722 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-29 22:35:33,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:33,726 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-29 22:35:33,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:35:33,790 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-29 22:35:33,791 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-29 22:35:33,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:33,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:33,797 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-29 22:35:33,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:35:34,415 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-29 22:35:34,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:34,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:34,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:34,425 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-29 22:35:34,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:34,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:34,459 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-29 22:35:34,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-29 22:35:34,814 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-29 22:35:34,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:34,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 56 [2018-01-29 22:35:34,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-29 22:35:34,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-29 22:35:34,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=3050, Unknown=0, NotChecked=0, Total=3192 [2018-01-29 22:35:34,835 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 57 states. [2018-01-29 22:35:35,924 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 85 DAG size of output 82 [2018-01-29 22:35:36,312 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 83 [2018-01-29 22:35:36,679 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 102 DAG size of output 100 [2018-01-29 22:35:37,099 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 106 DAG size of output 104 [2018-01-29 22:35:37,845 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 90 DAG size of output 87 [2018-01-29 22:35:39,523 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-01-29 22:35:39,715 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 92 DAG size of output 91 [2018-01-29 22:35:39,943 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 111 DAG size of output 106 [2018-01-29 22:35:40,598 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-29 22:35:40,820 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 93 DAG size of output 87 [2018-01-29 22:35:41,082 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-01-29 22:35:41,291 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 100 DAG size of output 93 [2018-01-29 22:35:41,477 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-01-29 22:35:41,945 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 88 DAG size of output 85 [2018-01-29 22:35:42,458 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 87 DAG size of output 81 [2018-01-29 22:35:43,494 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-01-29 22:35:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:44,629 INFO L93 Difference]: Finished difference Result 219 states and 230 transitions. [2018-01-29 22:35:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 22:35:44,630 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 72 [2018-01-29 22:35:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:44,631 INFO L225 Difference]: With dead ends: 219 [2018-01-29 22:35:44,631 INFO L226 Difference]: Without dead ends: 218 [2018-01-29 22:35:44,632 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2687 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=925, Invalid=10415, Unknown=2, NotChecked=0, Total=11342 [2018-01-29 22:35:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-29 22:35:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2018-01-29 22:35:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:35:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-29 22:35:44,648 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-29 22:35:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:44,648 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-29 22:35:44,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-29 22:35:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-29 22:35:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 22:35:44,649 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:44,649 INFO L350 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-29 22:35:44,649 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1251612174, now seen corresponding path program 5 times [2018-01-29 22:35:44,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:44,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:44,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:44,651 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:44,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:44,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:45,348 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-29 22:35:45,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:45,348 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-29 22:35:45,353 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:35:45,361 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:45,365 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:45,373 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:45,377 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:45,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:45,383 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-29 22:35:45,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,391 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-29 22:35:45,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,396 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-29 22:35:45,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:35:45,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:45,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:45,460 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-29 22:35:45,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:45,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:45,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:35:45,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,478 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-29 22:35:45,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-29 22:35:45,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-29 22:35:45,544 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-29 22:35:45,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,551 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-29 22:35:45,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-29 22:35:45,748 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-29 22:35:45,752 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-29 22:35:45,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:45,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:45,766 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-29 22:35:45,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:45 [2018-01-29 22:35:46,483 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-29 22:35:46,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:46,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 58 [2018-01-29 22:35:46,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-29 22:35:46,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-29 22:35:46,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3253, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 22:35:46,514 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 59 states. [2018-01-29 22:35:47,431 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 80 DAG size of output 66 [2018-01-29 22:35:47,675 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 89 DAG size of output 73 [2018-01-29 22:35:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:51,979 INFO L93 Difference]: Finished difference Result 230 states and 242 transitions. [2018-01-29 22:35:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 22:35:51,979 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-01-29 22:35:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:51,980 INFO L225 Difference]: With dead ends: 230 [2018-01-29 22:35:51,980 INFO L226 Difference]: Without dead ends: 229 [2018-01-29 22:35:51,981 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=964, Invalid=10808, Unknown=0, NotChecked=0, Total=11772 [2018-01-29 22:35:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-29 22:35:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 185. [2018-01-29 22:35:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:35:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-29 22:35:52,010 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 76 [2018-01-29 22:35:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:52,011 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-29 22:35:52,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-29 22:35:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-29 22:35:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 22:35:52,011 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:52,011 INFO L350 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-29 22:35:52,011 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:35:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 160836131, now seen corresponding path program 2 times [2018-01-29 22:35:52,012 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:52,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:52,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:52,012 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:52,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:52,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:52,613 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-29 22:35:52,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:52,614 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-29 22:35:52,618 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:35:52,631 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:52,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:35:52,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:52,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:52,648 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-29 22:35:52,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,652 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-29 22:35:52,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:35:52,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:52,700 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-29 22:35:52,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:52,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:35:52,708 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-29 22:35:52,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,712 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-29 22:35:52,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:35:52,757 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-29 22:35:52,758 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-29 22:35:52,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,763 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-29 22:35:52,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:35:52,798 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-29 22:35:52,800 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-29 22:35:52,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,809 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-29 22:35:52,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-29 22:35:53,280 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-29 22:35:53,288 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-29 22:35:53,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:53,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:53,314 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-29 22:35:53,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:63 [2018-01-29 22:35:53,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-29 22:35:53,488 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-29 22:35:53,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,498 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-29 22:35:53,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-29 22:35:53,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 22:35:53,641 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-29 22:35:53,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:53,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:53,652 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-29 22:35:53,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:35:53,810 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-29 22:35:53,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:53,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2018-01-29 22:35:53,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-29 22:35:53,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-29 22:35:53,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2355, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 22:35:53,832 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 51 states. [2018-01-29 22:36:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:01,112 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-29 22:36:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-29 22:36:01,112 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2018-01-29 22:36:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:01,113 INFO L225 Difference]: With dead ends: 195 [2018-01-29 22:36:01,113 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 22:36:01,114 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=961, Invalid=6695, Unknown=0, NotChecked=0, Total=7656 [2018-01-29 22:36:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 22:36:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-01-29 22:36:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:36:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-29 22:36:01,130 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-29 22:36:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:01,130 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-29 22:36:01,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-29 22:36:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-29 22:36:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 22:36:01,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:01,130 INFO L350 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-29 22:36:01,131 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1882956238, now seen corresponding path program 6 times [2018-01-29 22:36:01,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:01,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:01,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:01,131 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:36:01,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:01,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:02,592 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-29 22:36:02,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:02,593 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-29 22:36:02,598 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 22:36:02,610 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:02,615 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:02,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:02,625 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:02,631 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:02,634 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:02,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:02,644 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-29 22:36:02,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,657 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-29 22:36:02,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,662 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-29 22:36:02,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:36:02,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:02,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:02,742 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-29 22:36:02,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:02,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:02,754 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-29 22:36:02,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,760 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-29 22:36:02,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-29 22:36:02,836 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-29 22:36:02,838 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-29 22:36:02,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:02,845 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-29 22:36:02,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-29 22:36:03,591 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-29 22:36:03,610 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-29 22:36:03,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-29 22:36:03,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:03,688 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-29 22:36:03,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:150 [2018-01-29 22:36:04,558 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-29 22:36:04,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:04,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2018-01-29 22:36:04,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-29 22:36:04,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-29 22:36:04,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4335, Unknown=0, NotChecked=0, Total=4556 [2018-01-29 22:36:04,580 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 68 states. [2018-01-29 22:36:05,636 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 93 DAG size of output 64 [2018-01-29 22:36:05,898 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 117 DAG size of output 82 [2018-01-29 22:36:06,542 WARN L146 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 128 DAG size of output 83 [2018-01-29 22:36:07,323 WARN L146 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 134 DAG size of output 83 [2018-01-29 22:36:07,597 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 123 DAG size of output 81 [2018-01-29 22:36:08,425 WARN L146 SmtUtils]: Spent 702ms on a formula simplification. DAG size of input: 146 DAG size of output 98 [2018-01-29 22:36:09,616 WARN L146 SmtUtils]: Spent 502ms on a formula simplification. DAG size of input: 162 DAG size of output 111 [2018-01-29 22:36:10,388 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 138 DAG size of output 93 [2018-01-29 22:36:11,656 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 143 DAG size of output 95 [2018-01-29 22:36:12,509 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 137 DAG size of output 94 [2018-01-29 22:36:13,599 WARN L146 SmtUtils]: Spent 557ms on a formula simplification. DAG size of input: 135 DAG size of output 92 [2018-01-29 22:36:14,512 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 159 DAG size of output 108 [2018-01-29 22:36:15,361 WARN L146 SmtUtils]: Spent 660ms on a formula simplification. DAG size of input: 149 DAG size of output 111 [2018-01-29 22:36:15,642 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 123 DAG size of output 106 [2018-01-29 22:36:16,123 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 140 DAG size of output 113 [2018-01-29 22:36:16,425 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 127 DAG size of output 102 [2018-01-29 22:36:17,270 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 137 DAG size of output 115 [2018-01-29 22:36:18,348 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 113 DAG size of output 96 [2018-01-29 22:36:18,554 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 102 DAG size of output 83 [2018-01-29 22:36:18,773 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 107 DAG size of output 82 [2018-01-29 22:36:19,041 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 125 DAG size of output 103 [2018-01-29 22:36:19,347 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 117 DAG size of output 95 [2018-01-29 22:36:20,656 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 118 DAG size of output 97 [2018-01-29 22:36:20,902 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 113 DAG size of output 96 [2018-01-29 22:36:21,163 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 120 DAG size of output 103 [2018-01-29 22:36:21,394 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 103 DAG size of output 84 [2018-01-29 22:36:21,700 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 132 DAG size of output 115 [2018-01-29 22:36:21,917 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 109 DAG size of output 88 [2018-01-29 22:36:22,216 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 104 DAG size of output 85 [2018-01-29 22:36:24,279 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 122 DAG size of output 105 [2018-01-29 22:36:25,188 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 115 DAG size of output 98 [2018-01-29 22:36:25,671 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 112 DAG size of output 95 [2018-01-29 22:36:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:25,991 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-01-29 22:36:25,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 22:36:25,991 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 79 [2018-01-29 22:36:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:25,992 INFO L225 Difference]: With dead ends: 145 [2018-01-29 22:36:25,992 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 22:36:25,993 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3109 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1046, Invalid=11380, Unknown=6, NotChecked=0, Total=12432 [2018-01-29 22:36:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 22:36:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2018-01-29 22:36:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:36:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-29 22:36:26,013 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-29 22:36:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:26,014 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-29 22:36:26,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-01-29 22:36:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-29 22:36:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-29 22:36:26,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:26,014 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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-29 22:36:26,014 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:36:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2064167032, now seen corresponding path program 6 times [2018-01-29 22:36:26,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:26,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:26,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:26,015 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:36:26,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:26,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:27,578 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 59 DAG size of output 49 [2018-01-29 22:36:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:28,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:28,422 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:36:28,428 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 22:36:28,439 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,443 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,445 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command Received shutdown request... [2018-01-29 22:36:28,449 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,452 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,455 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,459 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,461 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:36:28,464 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:28,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:28,468 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 22:36:28,468 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:36:28,472 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:36:28,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:36:28 BoogieIcfgContainer [2018-01-29 22:36:28,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:36:28,473 INFO L168 Benchmark]: Toolchain (without parser) took 132949.48 ms. Allocated memory was 309.9 MB in the beginning and 591.9 MB in the end (delta: 282.1 MB). Free memory was 269.9 MB in the beginning and 447.5 MB in the end (delta: -177.6 MB). Peak memory consumption was 104.5 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:28,474 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 309.9 MB. Free memory is still 275.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:36:28,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.36 ms. Allocated memory is still 309.9 MB. Free memory was 268.9 MB in the beginning and 258.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:28,474 INFO L168 Benchmark]: Boogie Preprocessor took 36.02 ms. Allocated memory is still 309.9 MB. Free memory was 258.9 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:28,474 INFO L168 Benchmark]: RCFGBuilder took 284.27 ms. Allocated memory is still 309.9 MB. Free memory was 256.9 MB in the beginning and 236.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:28,475 INFO L168 Benchmark]: TraceAbstraction took 132410.81 ms. Allocated memory was 309.9 MB in the beginning and 591.9 MB in the end (delta: 282.1 MB). Free memory was 235.2 MB in the beginning and 447.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 69.8 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:28,477 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 309.9 MB. Free memory is still 275.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.36 ms. Allocated memory is still 309.9 MB. Free memory was 268.9 MB in the beginning and 258.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.02 ms. Allocated memory is still 309.9 MB. Free memory was 258.9 MB in the beginning and 256.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.27 ms. Allocated memory is still 309.9 MB. Free memory was 256.9 MB in the beginning and 236.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 132410.81 ms. Allocated memory was 309.9 MB in the beginning and 591.9 MB in the end (delta: 282.1 MB). Free memory was 235.2 MB in the beginning and 447.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 69.8 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 analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 11 error locations. TIMEOUT Result, 132.3s OverallTime, 34 OverallIterations, 8 TraceHistogramMax, 95.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1980 SDtfs, 7437 SDslu, 27061 SDs, 0 SdLazy, 20575 SolverSat, 1033 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2341 GetRequests, 883 SyntacticMatches, 27 SemanticMatches, 1431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23286 ImplicationChecksByTransitivity, 94.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, 33 MinimizatonAttempts, 424 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.4s 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-29_22-36-28-485.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-29_22-36-28-485.csv Completed graceful shutdown