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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:40:54,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:40:54,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:40:54,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:40:54,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:40:54,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:40:54,157 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:40:54,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:40:54,160 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:40:54,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:40:54,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:40:54,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:40:54,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:40:54,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:40:54,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:40:54,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:40:54,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:40:54,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:40:54,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:40:54,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:40:54,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:40:54,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:40:54,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:40:54,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:40:54,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:40:54,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:40:54,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:40:54,176 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:40:54,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:40:54,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:40:54,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:40:54,176 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:40:54,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:40:54,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:40:54,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:40:54,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:40:54,187 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:40:54,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:40:54,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:40:54,187 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:40:54,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:40:54,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:40:54,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:40:54,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:40:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:40:54,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:40:54,227 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:40:54,230 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:40:54,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:40:54,231 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:40:54,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:40:54,408 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:40:54,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:40:54,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:40:54,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:40:54,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:40:54,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54, skipping insertion in model container [2018-02-02 08:40:54,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,424 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:40:54,450 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:40:54,539 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:40:54,554 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:40:54,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54 WrapperNode [2018-02-02 08:40:54,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:40:54,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:40:54,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:40:54,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:40:54,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... [2018-02-02 08:40:54,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:40:54,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:40:54,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:40:54,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:40:54,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 08:40:54,623 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:40:54,623 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:40:54,624 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-02-02 08:40:54,624 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:40:54,624 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:40:54,625 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:40:54,798 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:40:54,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:40:54 BoogieIcfgContainer [2018-02-02 08:40:54,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:40:54,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:40:54,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:40:54,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:40:54,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:40:54" (1/3) ... [2018-02-02 08:40:54,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a5cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:40:54, skipping insertion in model container [2018-02-02 08:40:54,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:40:54" (2/3) ... [2018-02-02 08:40:54,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a5cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:40:54, skipping insertion in model container [2018-02-02 08:40:54,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:40:54" (3/3) ... [2018-02-02 08:40:54,805 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:40:54,810 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:40:54,814 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 08:40:54,837 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:40:54,837 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:40:54,837 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:40:54,837 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:40:54,837 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:40:54,837 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:40:54,837 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:40:54,838 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:40:54,838 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:40:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-02-02 08:40:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 08:40:54,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:54,854 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:54,854 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 104454547, now seen corresponding path program 1 times [2018-02-02 08:40:54,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:54,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:54,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:54,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:54,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:54,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:54,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:54,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:40:54,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:40:54,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:40:54,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:40:54,984 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-02-02 08:40:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,050 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 08:40:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:40:55,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 08:40:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,124 INFO L225 Difference]: With dead ends: 50 [2018-02-02 08:40:55,124 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:40:55,126 INFO L554 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-02-02 08:40:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:40:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 08:40:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 08:40:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 08:40:55,157 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11 [2018-02-02 08:40:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,157 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 08:40:55,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:40:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 08:40:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:40:55,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,158 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224676, now seen corresponding path program 1 times [2018-02-02 08:40:55,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:40:55,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:40:55,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:40:55,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:40:55,250 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-02-02 08:40:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,294 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-02 08:40:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:40:55,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 08:40:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,295 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:40:55,296 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:40:55,296 INFO L554 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-02-02 08:40:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:40:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 08:40:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 08:40:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 08:40:55,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-02-02 08:40:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,300 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 08:40:55,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:40:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 08:40:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:40:55,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,302 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,302 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224677, now seen corresponding path program 1 times [2018-02-02 08:40:55,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:40:55,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:40:55,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:40:55,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:40:55,395 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-02 08:40:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,463 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 08:40:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:40:55,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 08:40:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,465 INFO L225 Difference]: With dead ends: 44 [2018-02-02 08:40:55,465 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 08:40:55,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:40:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 08:40:55,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 08:40:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:40:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 08:40:55,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2018-02-02 08:40:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,469 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 08:40:55,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:40:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 08:40:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:40:55,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,470 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,470 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193927, now seen corresponding path program 1 times [2018-02-02 08:40:55,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:40:55,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:40:55,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:40:55,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:40:55,506 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-02-02 08:40:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,540 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 08:40:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:40:55,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:40:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,540 INFO L225 Difference]: With dead ends: 43 [2018-02-02 08:40:55,541 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 08:40:55,541 INFO L554 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-02-02 08:40:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 08:40:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 08:40:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:40:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:40:55,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-02-02 08:40:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,543 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:40:55,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:40:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:40:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:40:55,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,544 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,544 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193928, now seen corresponding path program 1 times [2018-02-02 08:40:55,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:40:55,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:40:55,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:40:55,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:40:55,587 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-02-02 08:40:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,662 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-02 08:40:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:40:55,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 08:40:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,664 INFO L225 Difference]: With dead ends: 58 [2018-02-02 08:40:55,664 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 08:40:55,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:40:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 08:40:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-02-02 08:40:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 08:40:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 08:40:55,670 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-02-02 08:40:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,670 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 08:40:55,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:40:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 08:40:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:40:55,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,671 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,671 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 659847302, now seen corresponding path program 1 times [2018-02-02 08:40:55,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:40:55,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:40:55,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:40:55,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:40:55,720 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-02-02 08:40:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,785 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 08:40:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:40:55,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 08:40:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,785 INFO L225 Difference]: With dead ends: 49 [2018-02-02 08:40:55,785 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 08:40:55,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:40:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 08:40:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-02 08:40:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 08:40:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 08:40:55,791 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2018-02-02 08:40:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,792 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 08:40:55,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:40:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 08:40:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:40:55,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,792 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,792 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash -262056781, now seen corresponding path program 1 times [2018-02-02 08:40:55,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:40:55,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:40:55,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:40:55,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:40:55,828 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-02-02 08:40:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:55,876 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-02 08:40:55,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:40:55,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 08:40:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:55,877 INFO L225 Difference]: With dead ends: 41 [2018-02-02 08:40:55,877 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 08:40:55,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:40:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 08:40:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 08:40:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 08:40:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 08:40:55,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-02 08:40:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:55,881 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 08:40:55,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:40:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 08:40:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:40:55,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:55,882 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:55,882 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash -262056780, now seen corresponding path program 1 times [2018-02-02 08:40:55,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:55,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:55,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:55,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:55,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:55,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:55,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:40:55,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:40:55,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:40:55,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:40:55,955 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-02-02 08:40:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:56,031 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 08:40:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:40:56,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 08:40:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:56,032 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:40:56,032 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:40:56,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:40:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:40:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 08:40:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:40:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:40:56,037 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2018-02-02 08:40:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:56,038 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:40:56,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:40:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:40:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:40:56,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:56,039 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:56,039 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1316966177, now seen corresponding path program 1 times [2018-02-02 08:40:56,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:56,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:56,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:56,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:56,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:56,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:40:56,163 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:40:56,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:56,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:40:56,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:40:56,226 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-02-02 08:40:56,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 08:40:56,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-02 08:40:56,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-02 08:40:56,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:56,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-02 08:40:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:56,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:40:56,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-02-02 08:40:56,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:40:56,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:40:56,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:40:56,309 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-02-02 08:40:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:56,569 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-02 08:40:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:40:56,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-02 08:40:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:56,571 INFO L225 Difference]: With dead ends: 88 [2018-02-02 08:40:56,571 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 08:40:56,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-02 08:40:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 08:40:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58. [2018-02-02 08:40:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:40:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-02 08:40:56,575 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2018-02-02 08:40:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:56,576 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-02 08:40:56,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:40:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-02 08:40:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:40:56,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:56,577 INFO L351 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-02-02 08:40:56,577 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766212, now seen corresponding path program 1 times [2018-02-02 08:40:56,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:56,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:56,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:56,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:56,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:56,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:56,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:40:56,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:40:56,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:40:56,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:40:56,631 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-02-02 08:40:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:56,740 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-02-02 08:40:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:40:56,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 08:40:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:56,741 INFO L225 Difference]: With dead ends: 57 [2018-02-02 08:40:56,741 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 08:40:56,742 INFO L554 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-02-02 08:40:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 08:40:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 08:40:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 08:40:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-02-02 08:40:56,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24 [2018-02-02 08:40:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:56,747 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-02-02 08:40:56,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:40:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-02-02 08:40:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:40:56,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:56,748 INFO L351 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-02-02 08:40:56,748 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766211, now seen corresponding path program 1 times [2018-02-02 08:40:56,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:56,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:56,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:56,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:56,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:56,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:56,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:40:56,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:40:56,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:40:56,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:40:56,824 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2018-02-02 08:40:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:56,889 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-02 08:40:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:40:56,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 08:40:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:56,890 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:40:56,890 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 08:40:56,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:40:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 08:40:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 08:40:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 08:40:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-02-02 08:40:56,893 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 24 [2018-02-02 08:40:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:56,893 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-02-02 08:40:56,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:40:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-02-02 08:40:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:40:56,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:56,894 INFO L351 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-02-02 08:40:56,894 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243135, now seen corresponding path program 1 times [2018-02-02 08:40:56,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:56,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:56,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:56,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:56,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:56,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:56,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:40:56,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:40:56,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:40:56,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:40:56,937 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-02-02 08:40:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:57,134 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-02 08:40:57,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:40:57,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 08:40:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:57,135 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:40:57,135 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:40:57,136 INFO L554 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-02-02 08:40:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:40:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 08:40:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 08:40:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-02-02 08:40:57,139 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 25 [2018-02-02 08:40:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:57,139 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-02-02 08:40:57,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:40:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-02-02 08:40:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:40:57,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:57,199 INFO L351 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-02-02 08:40:57,199 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243134, now seen corresponding path program 1 times [2018-02-02 08:40:57,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:57,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:57,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:57,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:57,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:57,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:57,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:40:57,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:40:57,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:40:57,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:40:57,450 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states. [2018-02-02 08:40:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:57,583 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-02 08:40:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:40:57,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 08:40:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:57,584 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:40:57,584 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 08:40:57,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:40:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 08:40:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-02-02 08:40:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 08:40:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-02-02 08:40:57,587 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 25 [2018-02-02 08:40:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:57,587 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-02-02 08:40:57,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:40:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-02-02 08:40:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:40:57,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:57,588 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:57,588 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1513907666, now seen corresponding path program 1 times [2018-02-02 08:40:57,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:57,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:57,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:57,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:57,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:40:57,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:57,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:40:57,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:40:57,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:40:57,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:40:57,694 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2018-02-02 08:40:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:57,862 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-02-02 08:40:57,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:40:57,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 08:40:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:57,863 INFO L225 Difference]: With dead ends: 102 [2018-02-02 08:40:57,863 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 08:40:57,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:40:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 08:40:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-02-02 08:40:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 08:40:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-02-02 08:40:57,867 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-02-02 08:40:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:57,867 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-02-02 08:40:57,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:40:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-02-02 08:40:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:40:57,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:57,868 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:40:57,868 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash -175036076, now seen corresponding path program 1 times [2018-02-02 08:40:57,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:57,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:57,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:57,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:57,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:58,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:40:58,005 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:40:58,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:58,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:40:58,033 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-02-02 08:40:58,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:40:58,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:58,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:40:58,087 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-02-02 08:40:58,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:40:58,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:40:58,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:58,094 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-02-02 08:40:58,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:40:58,193 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-02-02 08:40:58,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 08:40:58,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:40:58,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:40:58,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:40:58,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-02-02 08:40:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:58,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:40:58,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-02 08:40:58,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 08:40:58,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 08:40:58,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:40:58,309 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 21 states. [2018-02-02 08:40:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:58,934 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-02 08:40:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:40:58,934 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-02-02 08:40:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:58,934 INFO L225 Difference]: With dead ends: 83 [2018-02-02 08:40:58,935 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 08:40:58,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:40:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 08:40:58,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-02-02 08:40:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 08:40:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-02-02 08:40:58,938 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-02-02 08:40:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:58,938 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-02-02 08:40:58,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 08:40:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-02-02 08:40:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:40:58,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:58,939 INFO L351 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] [2018-02-02 08:40:58,939 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -707331403, now seen corresponding path program 1 times [2018-02-02 08:40:58,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:58,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:58,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:58,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:58,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:58,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:59,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:40:59,013 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:40:59,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:59,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:40:59,042 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-02-02 08:40:59,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:40:59,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:40:59,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-02 08:40:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:59,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:40:59,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-02-02 08:40:59,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:40:59,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:40:59,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:40:59,128 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 15 states. [2018-02-02 08:40:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:59,275 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-02-02 08:40:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:40:59,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-02-02 08:40:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:59,276 INFO L225 Difference]: With dead ends: 85 [2018-02-02 08:40:59,276 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 08:40:59,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:40:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 08:40:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-02-02 08:40:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 08:40:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-02-02 08:40:59,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 28 [2018-02-02 08:40:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:59,280 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-02-02 08:40:59,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:40:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-02-02 08:40:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:40:59,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:59,281 INFO L351 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] [2018-02-02 08:40:59,281 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash -653260906, now seen corresponding path program 1 times [2018-02-02 08:40:59,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:59,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:59,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:59,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:59,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:59,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:59,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:40:59,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 08:40:59,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:40:59,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:40:59,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:40:59,441 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 15 states. [2018-02-02 08:40:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:40:59,765 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-02-02 08:40:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:40:59,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 08:40:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:40:59,766 INFO L225 Difference]: With dead ends: 161 [2018-02-02 08:40:59,766 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 08:40:59,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:40:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 08:40:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2018-02-02 08:40:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 08:40:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2018-02-02 08:40:59,771 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 29 [2018-02-02 08:40:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:40:59,771 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2018-02-02 08:40:59,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:40:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2018-02-02 08:40:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:40:59,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:40:59,772 INFO L351 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] [2018-02-02 08:40:59,772 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:40:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash -434406188, now seen corresponding path program 1 times [2018-02-02 08:40:59,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:40:59,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:40:59,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:59,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:40:59,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:40:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:40:59,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:40:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:40:59,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:40:59,983 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:40:59,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:41:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:00,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:00,016 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-02-02 08:41:00,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:41:00,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:00,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:00,066 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-02-02 08:41:00,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:41:00,100 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-02-02 08:41:00,101 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-02-02 08:41:00,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,106 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-02-02 08:41:00,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:41:00,128 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-02-02 08:41:00,130 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-02-02 08:41:00,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,139 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-02-02 08:41:00,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:41:00,347 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-02-02 08:41:00,350 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-02-02 08:41:00,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:00,361 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-02-02 08:41:00,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:00,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:00,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:00,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-02 08:41:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:00,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:00,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-02 08:41:00,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:41:00,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:41:00,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:41:00,420 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand 24 states. [2018-02-02 08:41:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:01,236 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2018-02-02 08:41:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:41:01,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-02-02 08:41:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:01,237 INFO L225 Difference]: With dead ends: 143 [2018-02-02 08:41:01,237 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 08:41:01,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:41:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 08:41:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-02-02 08:41:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 08:41:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-02-02 08:41:01,242 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 29 [2018-02-02 08:41:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:01,242 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-02-02 08:41:01,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:41:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-02-02 08:41:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:41:01,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:01,243 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:01,243 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -409487743, now seen corresponding path program 2 times [2018-02-02 08:41:01,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:01,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:01,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:41:01,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:01,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:01,612 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 54 DAG size of output 29 [2018-02-02 08:41:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:01,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:01,978 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:01,986 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:41:02,000 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:02,004 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:02,005 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:02,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:02,037 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-02-02 08:41:02,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:02,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:02,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:41:02,073 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-02-02 08:41:02,074 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-02-02 08:41:02,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:02,080 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-02-02 08:41:02,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:41:02,193 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 25 treesize of output 19 [2018-02-02 08:41:02,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:02,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-02-02 08:41:02,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:02,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:02,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:02,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-02-02 08:41:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:02,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:02,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-02-02 08:41:02,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 08:41:02,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 08:41:02,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:41:02,312 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 30 states. [2018-02-02 08:41:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:02,985 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2018-02-02 08:41:02,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:41:02,987 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-02-02 08:41:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:02,988 INFO L225 Difference]: With dead ends: 180 [2018-02-02 08:41:02,988 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 08:41:02,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:41:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 08:41:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2018-02-02 08:41:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 08:41:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-02-02 08:41:02,992 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 29 [2018-02-02 08:41:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:02,992 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-02-02 08:41:02,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 08:41:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-02-02 08:41:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:41:02,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:02,993 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:02,993 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1617883298, now seen corresponding path program 2 times [2018-02-02 08:41:02,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:02,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:02,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:02,993 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:02,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:03,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:03,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:03,076 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:03,082 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:41:03,094 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:03,096 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:03,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 08:41:03,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:41:03,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-02-02 08:41:03,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:41:03,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:41:03,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:41:03,149 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 12 states. [2018-02-02 08:41:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:03,297 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-02-02 08:41:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:41:03,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-02 08:41:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:03,298 INFO L225 Difference]: With dead ends: 154 [2018-02-02 08:41:03,298 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 08:41:03,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:41:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 08:41:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2018-02-02 08:41:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 08:41:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-02-02 08:41:03,301 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 31 [2018-02-02 08:41:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:03,301 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-02-02 08:41:03,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:41:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-02-02 08:41:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:41:03,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:03,302 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:03,302 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1342276044, now seen corresponding path program 3 times [2018-02-02 08:41:03,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:03,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:03,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:03,303 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:03,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:03,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:03,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:03,723 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:03,730 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:41:03,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:03,745 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:03,751 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:03,753 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:03,755 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:03,756 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:03,763 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:03,789 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-02-02 08:41:03,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:03,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:03,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:41:03,851 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-02-02 08:41:03,852 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-02-02 08:41:03,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:03,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:04,009 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-02-02 08:41:04,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:41:04,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-02-02 08:41:04,220 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 25 treesize of output 55 [2018-02-02 08:41:04,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-02 08:41:04,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:04,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:04,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-02-02 08:41:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:04,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:04,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33 [2018-02-02 08:41:04,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:41:04,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:41:04,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:41:04,379 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 34 states. [2018-02-02 08:41:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:05,258 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2018-02-02 08:41:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:41:05,258 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-02-02 08:41:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:05,259 INFO L225 Difference]: With dead ends: 185 [2018-02-02 08:41:05,259 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 08:41:05,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=2186, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 08:41:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 08:41:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2018-02-02 08:41:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 08:41:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-02-02 08:41:05,263 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 32 [2018-02-02 08:41:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:05,263 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-02-02 08:41:05,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 08:41:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-02-02 08:41:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:41:05,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:05,263 INFO L351 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] [2018-02-02 08:41:05,263 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash 785498486, now seen corresponding path program 1 times [2018-02-02 08:41:05,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:05,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:05,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:05,264 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:05,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:05,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:05,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:05,446 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:05,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:41:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:05,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:05,489 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-02-02 08:41:05,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,496 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-02-02 08:41:05,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-02-02 08:41:05,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:05,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:05,588 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-02-02 08:41:05,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:05,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:05,601 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-02-02 08:41:05,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:05,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-02 08:41:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:05,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:05,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-02 08:41:05,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:41:05,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:41:05,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:41:05,911 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 28 states. [2018-02-02 08:41:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:06,499 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions. [2018-02-02 08:41:06,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:41:06,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2018-02-02 08:41:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:06,500 INFO L225 Difference]: With dead ends: 188 [2018-02-02 08:41:06,500 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 08:41:06,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:41:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 08:41:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 151. [2018-02-02 08:41:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 08:41:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-02-02 08:41:06,504 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 33 [2018-02-02 08:41:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:06,504 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-02-02 08:41:06,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:41:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-02-02 08:41:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:41:06,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:06,505 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 08:41:06,505 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1281886369, now seen corresponding path program 2 times [2018-02-02 08:41:06,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:06,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:06,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:06,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:41:06,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:06,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:06,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:06,781 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:06,786 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:41:06,796 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:06,802 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:06,804 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:06,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41: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-02-02 08:41:06,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,813 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-02-02 08:41:06,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:41:06,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:06,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:06,821 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-02-02 08:41:06,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,826 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-02-02 08:41:06,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:41:06,864 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-02-02 08:41:06,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 08:41:06,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-02-02 08:41:06,894 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-02-02 08:41:06,895 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-02-02 08:41:06,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:06,907 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-02-02 08:41:06,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-02-02 08:41:07,053 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-02-02 08:41:07,060 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-02-02 08:41:07,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:07,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:07,081 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-02-02 08:41:07,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-02-02 08:41:07,143 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-02-02 08:41:07,147 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-02-02 08:41:07,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:07,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:07,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:07,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-02-02 08:41:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:07,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:07,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-02 08:41:07,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 08:41:07,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 08:41:07,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:41:07,247 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 29 states. [2018-02-02 08:41:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:07,774 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2018-02-02 08:41:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:41:07,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-02-02 08:41:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:07,775 INFO L225 Difference]: With dead ends: 173 [2018-02-02 08:41:07,775 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 08:41:07,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:41:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 08:41:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-02-02 08:41:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 08:41:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-02-02 08:41:07,778 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 34 [2018-02-02 08:41:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:07,778 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-02-02 08:41:07,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 08:41:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-02-02 08:41:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:41:07,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:07,779 INFO L351 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] [2018-02-02 08:41:07,779 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash 304009148, now seen corresponding path program 1 times [2018-02-02 08:41:07,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:07,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:07,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:07,780 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:07,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:07,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:07,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:41:07,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:41:07,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:41:07,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:41:07,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:41:07,834 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 6 states. [2018-02-02 08:41:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:07,897 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2018-02-02 08:41:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:41:07,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 08:41:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:07,898 INFO L225 Difference]: With dead ends: 160 [2018-02-02 08:41:07,898 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:41:07,898 INFO L554 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-02-02 08:41:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:41:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-02 08:41:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:41:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-02-02 08:41:07,900 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 35 [2018-02-02 08:41:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:07,900 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-02-02 08:41:07,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:41:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-02-02 08:41:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:41:07,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:07,901 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:07,901 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:07,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1600146015, now seen corresponding path program 4 times [2018-02-02 08:41:07,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:07,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:07,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:07,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:41:07,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:07,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:08,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:08,345 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:08,366 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:41:08,379 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:08,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:08,398 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-02-02 08:41:08,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:08,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:08,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:41:08,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-02-02 08:41:08,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:41:08,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:08,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:08,439 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-02-02 08:41:08,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:41:08,716 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-02-02 08:41:08,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:08,727 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-02-02 08:41:08,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:08,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:08,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:08,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-02-02 08:41:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:08,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:08,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37 [2018-02-02 08:41:08,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 08:41:08,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 08:41:08,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 08:41:08,878 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 38 states. [2018-02-02 08:41:09,526 WARN L146 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 68 DAG size of output 39 [2018-02-02 08:41:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:10,964 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-02-02 08:41:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 08:41:10,964 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 35 [2018-02-02 08:41:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:10,965 INFO L225 Difference]: With dead ends: 150 [2018-02-02 08:41:10,965 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 08:41:10,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=386, Invalid=2806, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 08:41:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 08:41:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2018-02-02 08:41:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 08:41:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-02 08:41:10,968 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 35 [2018-02-02 08:41:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:10,969 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-02 08:41:10,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 08:41:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-02 08:41:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:41:10,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:10,969 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:10,969 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1381463977, now seen corresponding path program 2 times [2018-02-02 08:41:10,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:10,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:10,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:10,971 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:10,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:10,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:11,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:11,349 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:11,368 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:41:11,376 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:11,380 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:11,383 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:11,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:11,392 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-02-02 08:41:11,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,397 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-02-02 08:41:11,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-02 08:41:11,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:11,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:11,432 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-02-02 08:41:11,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:11,438 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-02-02 08:41:11,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-02 08:41:11,475 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-02-02 08:41:11,476 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-02-02 08:41:11,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:11,480 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-02-02 08:41:11,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-02 08:41:11,534 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-02-02 08:41:11,538 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-02-02 08:41:11,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:11,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:11,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:11,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2018-02-02 08:41:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:11,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:11,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-02 08:41:11,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 08:41:11,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 08:41:11,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 08:41:11,716 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 33 states. [2018-02-02 08:41:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:12,487 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2018-02-02 08:41:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:41:12,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2018-02-02 08:41:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:12,488 INFO L225 Difference]: With dead ends: 165 [2018-02-02 08:41:12,488 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 08:41:12,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=2224, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 08:41:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 08:41:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2018-02-02 08:41:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 08:41:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-02 08:41:12,491 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 36 [2018-02-02 08:41:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:12,491 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-02 08:41:12,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 08:41:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-02 08:41:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:41:12,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:12,492 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-02 08:41:12,492 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:12,492 INFO L82 PathProgramCache]: Analyzing trace with hash 269048756, now seen corresponding path program 3 times [2018-02-02 08:41:12,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:12,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:12,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:12,493 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:12,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:12,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:41:12,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:12,715 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:12,719 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:41:12,730 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:12,734 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:12,739 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:12,743 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:12,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:12,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:12,763 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-02-02 08:41:12,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,769 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-02-02 08:41:12,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:41:12,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:12,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:12,784 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-02-02 08:41:12,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,793 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-02-02 08:41:12,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:41:12,810 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-02-02 08:41:12,812 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-02-02 08:41:12,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 08:41:12,843 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-02-02 08:41:12,848 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-02-02 08:41:12,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:12,856 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-02-02 08:41:12,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-02 08:41:12,986 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-02-02 08:41:12,993 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-02-02 08:41:12,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:13,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:13,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 08:41:13,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-02-02 08:41:13,035 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-02-02 08:41:13,036 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-02-02 08:41:13,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:13,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:13,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:13,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-02 08:41:13,064 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-02-02 08:41:13,068 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-02-02 08:41:13,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:13,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:13,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:13,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-02 08:41:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:41:13,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:13,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2018-02-02 08:41:13,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:41:13,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:41:13,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:41:13,132 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 26 states. [2018-02-02 08:41:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:13,605 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-02 08:41:13,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:41:13,605 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-02-02 08:41:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:13,606 INFO L225 Difference]: With dead ends: 125 [2018-02-02 08:41:13,606 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:41:13,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 08:41:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:41:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-02-02 08:41:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 08:41:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-02 08:41:13,609 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 39 [2018-02-02 08:41:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:13,609 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-02 08:41:13,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:41:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-02 08:41:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:41:13,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:13,610 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-02-02 08:41:13,610 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash 394604694, now seen corresponding path program 3 times [2018-02-02 08:41:13,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:13,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:13,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:13,613 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:13,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:13,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:14,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:14,073 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:14,078 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:41:14,087 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:14,091 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:14,094 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:14,097 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:41:14,099 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:14,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:14,105 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-02-02 08:41:14,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,110 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-02-02 08:41:14,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-02 08:41:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:14,150 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-02-02 08:41:14,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:14,160 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-02-02 08:41:14,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-02 08:41:14,211 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-02-02 08:41:14,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:41:14,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:14,219 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-02-02 08:41:14,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-02-02 08:41:14,406 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 25 treesize of output 19 [2018-02-02 08:41:14,514 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 19 treesize of output 29 [2018-02-02 08:41:14,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-02 08:41:14,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:14,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:14,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99 [2018-02-02 08:41:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:14,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:14,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-02-02 08:41:14,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 08:41:14,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 08:41:14,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 08:41:14,907 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 38 states. [2018-02-02 08:41:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:15,985 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-02 08:41:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 08:41:15,986 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2018-02-02 08:41:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:15,986 INFO L225 Difference]: With dead ends: 101 [2018-02-02 08:41:15,986 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 08:41:15,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=2597, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 08:41:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 08:41:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-02 08:41:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:41:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-02 08:41:15,989 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 39 [2018-02-02 08:41:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:15,989 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-02 08:41:15,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 08:41:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-02 08:41:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:41:15,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:15,990 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:41:15,990 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash 708041921, now seen corresponding path program 5 times [2018-02-02 08:41:15,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:15,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:15,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:15,991 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:15,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:16,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:17,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:17,085 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:17,089 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:41:17,094 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,095 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,096 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,097 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,099 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,100 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,105 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:17,107 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:17,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:17,127 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-02-02 08:41:17,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:17,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:17,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:41:17,173 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-02-02 08:41:17,175 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-02-02 08:41:17,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:17,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:17,180 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-02-02 08:41:17,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:41:17,714 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 68 treesize of output 54 [2018-02-02 08:41:17,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:17,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187 [2018-02-02 08:41:17,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:17,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:17,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:17,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-02-02 08:41:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:18,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:18,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45 [2018-02-02 08:41:18,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 08:41:18,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 08:41:18,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 08:41:18,004 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 46 states. [2018-02-02 08:41:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:22,220 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-02-02 08:41:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 08:41:22,220 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 41 [2018-02-02 08:41:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:22,221 INFO L225 Difference]: With dead ends: 152 [2018-02-02 08:41:22,221 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 08:41:22,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=704, Invalid=4846, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 08:41:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 08:41:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2018-02-02 08:41:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 08:41:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-02-02 08:41:22,224 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 41 [2018-02-02 08:41:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:22,224 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-02-02 08:41:22,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 08:41:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-02-02 08:41:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 08:41:22,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:22,224 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2018-02-02 08:41:22,224 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash -79154039, now seen corresponding path program 4 times [2018-02-02 08:41:22,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:22,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:22,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:22,225 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:22,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:22,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:23,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:23,132 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:23,138 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:41:23,152 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:23,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:23,159 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 19 treesize of output 18 [2018-02-02 08:41:23,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,168 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 28 treesize of output 27 [2018-02-02 08:41:23,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,176 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 27 treesize of output 26 [2018-02-02 08:41:23,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,177 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 18 treesize of output 17 [2018-02-02 08:41:23,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:23,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41 [2018-02-02 08:41:23,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,255 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 27 treesize of output 21 [2018-02-02 08:41:23,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 08:41:23,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,283 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 37 treesize of output 46 [2018-02-02 08:41:23,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:23,295 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 36 treesize of output 30 [2018-02-02 08:41:23,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:23,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40 [2018-02-02 08:41:23,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-02-02 08:41:23,366 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 18 treesize of output 17 [2018-02-02 08:41:23,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,378 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 37 treesize of output 34 [2018-02-02 08:41:23,379 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-02-02 08:41:23,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:23,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 08:41:23,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-02-02 08:41:23,963 WARN L143 SmtUtils]: Spent 384ms on a formula simplification that was a NOOP. DAG size: 45 [2018-02-02 08:41:24,466 WARN L143 SmtUtils]: Spent 336ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-02 08:41:25,164 WARN L143 SmtUtils]: Spent 617ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-02 08:41:25,168 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 68 treesize of output 60 [2018-02-02 08:41:25,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,178 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-02-02 08:41:25,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:25,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:25,233 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 65 treesize of output 57 [2018-02-02 08:41:25,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:25,241 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 37 treesize of output 79 [2018-02-02 08:41:25,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:25,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:25,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 08:41:25,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278 [2018-02-02 08:41:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:25,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:25,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-02-02 08:41:25,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 08:41:25,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 08:41:25,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1619, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 08:41:25,647 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 42 states. [2018-02-02 08:41:27,004 WARN L146 SmtUtils]: Spent 963ms on a formula simplification. DAG size of input: 133 DAG size of output 67 [2018-02-02 08:41:28,807 WARN L146 SmtUtils]: Spent 1756ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-02-02 08:41:30,720 WARN L146 SmtUtils]: Spent 1862ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-02 08:41:37,759 WARN L146 SmtUtils]: Spent 6978ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-02-02 08:41:38,931 WARN L146 SmtUtils]: Spent 1092ms on a formula simplification. DAG size of input: 123 DAG size of output 88 [2018-02-02 08:41:43,420 WARN L146 SmtUtils]: Spent 4228ms on a formula simplification. DAG size of input: 133 DAG size of output 94 [2018-02-02 08:41:47,321 WARN L146 SmtUtils]: Spent 3836ms on a formula simplification. DAG size of input: 118 DAG size of output 102 [2018-02-02 08:41:50,351 WARN L146 SmtUtils]: Spent 2979ms on a formula simplification. DAG size of input: 129 DAG size of output 108 [2018-02-02 08:41:50,849 WARN L146 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-02 08:41:51,792 WARN L146 SmtUtils]: Spent 875ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-02 08:41:52,015 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-02-02 08:41:53,316 WARN L146 SmtUtils]: Spent 1241ms on a formula simplification. DAG size of input: 92 DAG size of output 78 [2018-02-02 08:41:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:41:53,977 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 08:41:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 08:41:53,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-02-02 08:41:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:41:53,978 INFO L225 Difference]: With dead ends: 139 [2018-02-02 08:41:53,978 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 08:41:53,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=341, Invalid=3949, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 08:41:53,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 08:41:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-02-02 08:41:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 08:41:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-02 08:41:53,981 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 42 [2018-02-02 08:41:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:41:53,981 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-02 08:41:53,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 08:41:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-02 08:41:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 08:41:53,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:41:53,981 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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] [2018-02-02 08:41:53,982 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:41:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash -563034186, now seen corresponding path program 5 times [2018-02-02 08:41:53,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:41:53,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:41:53,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:53,982 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:41:53,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:41:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:41:54,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:41:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:55,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:41:55,356 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 08:41:55,361 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 08:41:55,366 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,367 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,368 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,369 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,371 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,376 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:41:55,380 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:41:55,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:41:55,386 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-02-02 08:41:55,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,392 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-02-02 08:41:55,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:25 [2018-02-02 08:41:55,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,450 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-02-02 08:41:55,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,457 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 20 treesize of output 29 [2018-02-02 08:41:55,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-02-02 08:41:55,520 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-02-02 08:41:55,522 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-02-02 08:41:55,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:41:55,527 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-02-02 08:41:55,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-02 08:41:55,887 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 41 treesize of output 31 [2018-02-02 08:41:55,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:41:55,897 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 31 treesize of output 53 [2018-02-02 08:41:55,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:41:55,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:55,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:41:55,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:151 [2018-02-02 08:41:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:41:56,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:41:56,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-02-02 08:41:56,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 08:41:56,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 08:41:56,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1782, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:41:56,171 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 44 states. [2018-02-02 08:41:56,963 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 143 DAG size of output 59 Received shutdown request... [2018-02-02 08:41:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:41:57,960 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:41:57,963 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:41:57,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:41:57 BoogieIcfgContainer [2018-02-02 08:41:57,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:41:57,964 INFO L168 Benchmark]: Toolchain (without parser) took 63556.33 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 752.4 MB). Free memory was 353.5 MB in the beginning and 724.5 MB in the end (delta: -371.0 MB). Peak memory consumption was 381.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:41:57,965 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 397.9 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:41:57,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.36 ms. Allocated memory is still 397.9 MB. Free memory was 352.2 MB in the beginning and 341.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:41:57,966 INFO L168 Benchmark]: Boogie Preprocessor took 26.13 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:41:57,966 INFO L168 Benchmark]: RCFGBuilder took 211.68 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 321.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:41:57,966 INFO L168 Benchmark]: TraceAbstraction took 63164.39 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 752.4 MB). Free memory was 321.0 MB in the beginning and 724.5 MB in the end (delta: -403.5 MB). Peak memory consumption was 348.9 MB. Max. memory is 5.3 GB. [2018-02-02 08:41:57,968 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.11 ms. Allocated memory is still 397.9 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.36 ms. Allocated memory is still 397.9 MB. Free memory was 352.2 MB in the beginning and 341.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.13 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 211.68 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 321.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63164.39 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 752.4 MB). Free memory was 321.0 MB in the beginning and 724.5 MB in the end (delta: -403.5 MB). Peak memory consumption was 348.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (125states) and interpolant automaton (currently 24 states, 44 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 11 error locations. TIMEOUT Result, 63.1s OverallTime, 31 OverallIterations, 8 TraceHistogramMax, 45.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1027 SDtfs, 2616 SDslu, 8439 SDs, 0 SdLazy, 9550 SolverSat, 783 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1211 GetRequests, 369 SyntacticMatches, 16 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7537 ImplicationChecksByTransitivity, 49.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=23, 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.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 394 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1354 ConstructedInterpolants, 119 QuantifiedInterpolants, 739609 SizeOfPredicates, 234 NumberOfNonLiveVariables, 2653 ConjunctsInSsa, 837 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 29/694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-41-57-973.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-41-57-973.csv Completed graceful shutdown