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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:50:56,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:50:56,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:50:56,548 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:50:56,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:50:56,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:50:56,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:50:56,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:50:56,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:50:56,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:50:56,554 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:50:56,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:50:56,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:50:56,556 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:50:56,557 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:50:56,559 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:50:56,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:50:56,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:50:56,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:50:56,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:50:56,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:50:56,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:50:56,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:50:56,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:50:56,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:50:56,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:50:56,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:50:56,569 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:50:56,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:50:56,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:50:56,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:50:56,570 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:50:56,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:50:56,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:50:56,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:50:56,579 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:50:56,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:50:56,580 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:50:56,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:50:56,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:50:56,581 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:50:56,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:50:56,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:50:56,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:50:56,619 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:50:56,622 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:50:56,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:50:56,624 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:50:56,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:56,751 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:50:56,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:50:56,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:56,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:50:56,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:50:56,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309783a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56, skipping insertion in model container [2018-02-03 22:50:56,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:56,794 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:50:56,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:56,902 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:50:56,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56 WrapperNode [2018-02-03 22:50:56,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:50:56,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:50:56,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:50:56,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:50:56,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (1/1) ... [2018-02-03 22:50:56,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:50:56,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:50:56,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:50:56,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:50:56,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (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-03 22:50:56,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:50:56,972 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:50:56,972 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-02-03 22:50:56,973 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:50:56,973 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:50:57,157 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:50:57,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:57 BoogieIcfgContainer [2018-02-03 22:50:57,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:50:57,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:50:57,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:50:57,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:50:57,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:50:56" (1/3) ... [2018-02-03 22:50:57,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c850c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:57, skipping insertion in model container [2018-02-03 22:50:57,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:50:56" (2/3) ... [2018-02-03 22:50:57,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c850c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:50:57, skipping insertion in model container [2018-02-03 22:50:57,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:50:57" (3/3) ... [2018-02-03 22:50:57,163 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:50:57,169 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:50:57,174 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-03 22:50:57,207 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:50:57,207 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:50:57,207 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:50:57,207 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:50:57,208 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:50:57,208 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:50:57,208 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:50:57,208 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:50:57,209 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:50:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-03 22:50:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 22:50:57,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:57,229 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:57,229 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-02-03 22:50:57,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:57,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:57,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:57,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:57,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:57,346 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-03 22:50:57,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:57,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:50:57,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:50:57,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:50:57,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:50:57,362 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-02-03 22:50:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:57,426 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-03 22:50:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:50:57,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-03 22:50:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:57,491 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:50:57,492 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:50:57,493 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-03 22:50:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:50:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:50:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:50:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-03 22:50:57,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-02-03 22:50:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:57,515 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-03 22:50:57,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:50:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-03 22:50:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:50:57,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:57,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:57,516 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-02-03 22:50:57,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:57,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:57,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:57,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:57,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:57,582 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-03 22:50:57,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:57,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:50:57,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:50:57,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:50:57,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:50:57,584 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-02-03 22:50:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:57,644 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-03 22:50:57,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:50:57,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-03 22:50:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:57,645 INFO L225 Difference]: With dead ends: 46 [2018-02-03 22:50:57,646 INFO L226 Difference]: Without dead ends: 46 [2018-02-03 22:50:57,646 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-03 22:50:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-03 22:50:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-03 22:50:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:50:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-03 22:50:57,650 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-02-03 22:50:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:57,650 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-03 22:50:57,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:50:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-03 22:50:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:50:57,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:57,651 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:57,651 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-02-03 22:50:57,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:57,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:57,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:57,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:57,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:57,750 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-03 22:50:57,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:57,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:57,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:57,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:57,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:57,751 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-02-03 22:50:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:57,829 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-03 22:50:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:57,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-03 22:50:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:57,830 INFO L225 Difference]: With dead ends: 45 [2018-02-03 22:50:57,830 INFO L226 Difference]: Without dead ends: 45 [2018-02-03 22:50:57,830 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-03 22:50:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-03 22:50:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-03 22:50:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-03 22:50:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-03 22:50:57,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-02-03 22:50:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:57,835 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-03 22:50:57,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-03 22:50:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:50:57,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:57,835 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:57,836 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-02-03 22:50:57,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:57,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:57,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:57,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:57,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:57,871 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-03 22:50:57,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:57,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:50:57,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:50:57,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:50:57,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:50:57,872 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-02-03 22:50:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:57,920 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-03 22:50:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:50:57,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 22:50:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:57,921 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:50:57,921 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 22:50:57,921 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-03 22:50:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 22:50:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-03 22:50:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 22:50:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-03 22:50:57,924 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-02-03 22:50:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:57,924 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-03 22:50:57,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:50:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-03 22:50:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:50:57,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:57,924 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:57,925 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-02-03 22:50:57,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:57,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:57,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,926 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:57,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:57,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:57,988 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-03 22:50:57,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:57,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:57,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:57,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:57,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:57,990 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-03 22:50:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,095 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-03 22:50:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:50:58,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-03 22:50:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,097 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:50:58,097 INFO L226 Difference]: Without dead ends: 59 [2018-02-03 22:50:58,097 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-03 22:50:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-03 22:50:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-02-03 22:50:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:50:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-03 22:50:58,104 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-02-03 22:50:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,105 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-03 22:50:58,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-03 22:50:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:50:58,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,105 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:58,105 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-02-03 22:50:58,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,106 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,169 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-03 22:50:58,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:50:58,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:50:58,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:50:58,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:50:58,171 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-02-03 22:50:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,247 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-03 22:50:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:50:58,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-03 22:50:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,247 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:50:58,248 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:50:58,248 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-03 22:50:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:50:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-03 22:50:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-03 22:50:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-03 22:50:58,250 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-02-03 22:50:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,250 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-03 22:50:58,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:50:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-03 22:50:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:50:58,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,251 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-03 22:50:58,251 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-02-03 22:50:58,251 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,284 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-03 22:50:58,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:50:58,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:50:58,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:50:58,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:50:58,285 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-03 22:50:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,326 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-03 22:50:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:50:58,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-03 22:50:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,326 INFO L225 Difference]: With dead ends: 42 [2018-02-03 22:50:58,327 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:50:58,327 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-03 22:50:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:50:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-03 22:50:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-03 22:50:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-03 22:50:58,329 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-03 22:50:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,329 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-03 22:50:58,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:50:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-03 22:50:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:50:58,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,330 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-03 22:50:58,330 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,330 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-02-03 22:50:58,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,331 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,390 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-03 22:50:58,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:50:58,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:50:58,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:50:58,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:50:58,391 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-03 22:50:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,469 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-03 22:50:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:50:58,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-03 22:50:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,470 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:50:58,470 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:50:58,470 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-03 22:50:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:50:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-03 22:50:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 22:50:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-03 22:50:58,472 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-02-03 22:50:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,472 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-03 22:50:58,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:50:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-03 22:50:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:58,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,473 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-03 22:50:58,473 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-02-03 22:50:58,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,522 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-03 22:50:58,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:58,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:58,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:58,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:58,523 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-03 22:50:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,591 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-03 22:50:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:58,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-03 22:50:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,592 INFO L225 Difference]: With dead ends: 43 [2018-02-03 22:50:58,592 INFO L226 Difference]: Without dead ends: 43 [2018-02-03 22:50:58,592 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-03 22:50:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-03 22:50:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-03 22:50:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-03 22:50:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-03 22:50:58,595 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-02-03 22:50:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,595 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-03 22:50:58,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-03 22:50:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:58,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,596 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-03 22:50:58,596 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-02-03 22:50:58,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,690 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-03 22:50:58,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:58,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:50:58,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:50:58,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:50:58,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:50:58,692 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-02-03 22:50:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:58,845 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-03 22:50:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:50:58,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-03 22:50:58,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:58,846 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:50:58,846 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:50:58,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:50:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:50:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-02-03 22:50:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:50:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-03 22:50:58,849 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-02-03 22:50:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:58,849 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-03 22:50:58,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:50:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-03 22:50:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:50:58,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:58,850 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, 1] [2018-02-03 22:50:58,850 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-02-03 22:50:58,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:58,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:58,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:58,927 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-03 22:50:58,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:50:58,927 INFO L213 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-03 22:50:58,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:58,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:50:59,018 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-03 22:50:59,021 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-03 22:50:59,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:59,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:59,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:59,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-03 22:50:59,058 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-03 22:50:59,060 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-03 22:50:59,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:50:59,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:50:59,062 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-03 22:50:59,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-03 22:50:59,071 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-03 22:50:59,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:50:59,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-02-03 22:50:59,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:50:59,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:50:59,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:50:59,090 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-02-03 22:50:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,305 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-03 22:50:59,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:50:59,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-03 22:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,307 INFO L225 Difference]: With dead ends: 91 [2018-02-03 22:50:59,307 INFO L226 Difference]: Without dead ends: 91 [2018-02-03 22:50:59,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-03 22:50:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-03 22:50:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-02-03 22:50:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 22:50:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-03 22:50:59,312 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-02-03 22:50:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,313 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-03 22:50:59,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:50:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-03 22:50:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:50:59,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,314 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-03 22:50:59,314 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584510, now seen corresponding path program 1 times [2018-02-03 22:50:59,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,342 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-03 22:50:59,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:50:59,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:50:59,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:50:59,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:50:59,343 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-02-03 22:50:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,408 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-02-03 22:50:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:50:59,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-03 22:50:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,409 INFO L225 Difference]: With dead ends: 61 [2018-02-03 22:50:59,409 INFO L226 Difference]: Without dead ends: 61 [2018-02-03 22:50:59,409 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-03 22:50:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-03 22:50:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-03 22:50:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-03 22:50:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-03 22:50:59,413 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-02-03 22:50:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,414 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-03 22:50:59,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:50:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-03 22:50:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:50:59,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,415 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-03 22:50:59,415 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584509, now seen corresponding path program 1 times [2018-02-03 22:50:59,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,490 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-03 22:50:59,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:50:59,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:50:59,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:50:59,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:50:59,491 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-02-03 22:50:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,572 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-03 22:50:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:50:59,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-03 22:50:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,573 INFO L225 Difference]: With dead ends: 66 [2018-02-03 22:50:59,573 INFO L226 Difference]: Without dead ends: 66 [2018-02-03 22:50:59,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:50:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-03 22:50:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-02-03 22:50:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-03 22:50:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-03 22:50:59,577 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-02-03 22:50:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,577 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-03 22:50:59,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:50:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-03 22:50:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:50:59,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,578 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:59,579 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -99148426, now seen corresponding path program 1 times [2018-02-03 22:50:59,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,580 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:50:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 22:50:59,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:50:59,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:50:59,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:50:59,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:50:59,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:50:59,677 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-02-03 22:50:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:50:59,824 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-02-03 22:50:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:50:59,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-03 22:50:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:50:59,828 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:50:59,828 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 22:50:59,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:50:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 22:50:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-02-03 22:50:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-03 22:50:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-03 22:50:59,832 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-02-03 22:50:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:50:59,832 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-03 22:50:59,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:50:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-03 22:50:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:50:59,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:50:59,833 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:50:59,833 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:50:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash 323553400, now seen corresponding path program 1 times [2018-02-03 22:50:59,834 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:50:59,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:50:59,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:50:59,835 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:50:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:50:59,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:00,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:00,032 INFO L213 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-03 22:51:00,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:00,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:00,071 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-03 22:51:00,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,075 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-03 22:51:00,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:51:00,104 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-03 22:51:00,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 11 treesize of output 10 [2018-02-03 22:51:00,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:00,110 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-03 22:51:00,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:51:00,182 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-03 22:51:00,188 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-03 22:51:00,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:00,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:00,200 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-03 22:51:00,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-02-03 22:51:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:00,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:00,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-02-03 22:51:00,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:51:00,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:51:00,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:51:00,291 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-02-03 22:51:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:01,265 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-03 22:51:01,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:51:01,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-03 22:51:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:01,266 INFO L225 Difference]: With dead ends: 87 [2018-02-03 22:51:01,266 INFO L226 Difference]: Without dead ends: 87 [2018-02-03 22:51:01,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-03 22:51:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-02-03 22:51:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-03 22:51:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-03 22:51:01,270 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-02-03 22:51:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:01,270 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-03 22:51:01,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:51:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-03 22:51:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:01,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:01,271 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-03 22:51:01,272 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1309566295, now seen corresponding path program 1 times [2018-02-03 22:51:01,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:01,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:01,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:01,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:01,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:01,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:01,794 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 25 DAG size of output 20 [2018-02-03 22:51:01,835 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-03 22:51:01,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:01,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-03 22:51:01,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 22:51:01,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 22:51:01,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:51:01,836 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 15 states. [2018-02-03 22:51:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:02,334 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-02-03 22:51:02,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 22:51:02,335 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-03 22:51:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:02,335 INFO L225 Difference]: With dead ends: 161 [2018-02-03 22:51:02,335 INFO L226 Difference]: Without dead ends: 161 [2018-02-03 22:51:02,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-03 22:51:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-02-03 22:51:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-03 22:51:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-02-03 22:51:02,339 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 29 [2018-02-03 22:51:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:02,339 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-02-03 22:51:02,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 22:51:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2018-02-03 22:51:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:02,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:02,341 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-03 22:51:02,341 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1528421013, now seen corresponding path program 1 times [2018-02-03 22:51:02,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:02,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:02,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:02,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:02,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:02,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:02,527 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-03 22:51:02,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:02,527 INFO L213 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-03 22:51:02,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:02,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:02,549 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-03 22:51:02,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:51:02,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:02,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:02,587 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-03 22:51:02,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:51:02,632 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-03 22:51:02,635 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-03 22:51:02,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,643 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-03 22:51:02,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:51:02,670 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-03 22:51:02,677 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-03 22:51:02,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,687 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-03 22:51:02,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:51:02,823 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-03 22:51:02,829 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-03 22:51:02,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:02,848 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-03 22:51:02,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:02,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:02,875 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-03 22:51:02,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-03 22:51:02,929 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-03 22:51:02,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:02,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-03 22:51:02,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:51:02,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:51:02,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:51:02,964 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 24 states. [2018-02-03 22:51:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,081 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-02-03 22:51:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:51:04,081 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-02-03 22:51:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,082 INFO L225 Difference]: With dead ends: 144 [2018-02-03 22:51:04,083 INFO L226 Difference]: Without dead ends: 144 [2018-02-03 22:51:04,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1085, Unknown=1, NotChecked=0, Total=1260 [2018-02-03 22:51:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-03 22:51:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-02-03 22:51:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-03 22:51:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-03 22:51:04,086 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 29 [2018-02-03 22:51:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,086 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-03 22:51:04,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:51:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-03 22:51:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:04,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,088 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-03 22:51:04,088 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1438570336, now seen corresponding path program 1 times [2018-02-03 22:51:04,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:04,166 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-03 22:51:04,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:04,166 INFO L213 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-03 22:51:04,173 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:04,204 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-03 22:51:04,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:04,208 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-03 22:51:04,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-03 22:51:04,273 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-03 22:51:04,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:04,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-02-03 22:51:04,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 22:51:04,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 22:51:04,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:51:04,293 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 15 states. [2018-02-03 22:51:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:04,411 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-03 22:51:04,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:51:04,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-03 22:51:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:04,412 INFO L225 Difference]: With dead ends: 153 [2018-02-03 22:51:04,412 INFO L226 Difference]: Without dead ends: 153 [2018-02-03 22:51:04,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 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-03 22:51:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-03 22:51:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2018-02-03 22:51:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-03 22:51:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-03 22:51:04,415 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2018-02-03 22:51:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:04,416 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-03 22:51:04,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 22:51:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-03 22:51:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:51:04,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:04,417 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:04,417 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1106610309, now seen corresponding path program 2 times [2018-02-03 22:51:04,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:04,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:04,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,418 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:04,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:04,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:04,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:04,891 INFO L213 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-03 22:51:04,896 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:04,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:04,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:04,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:04,926 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-03 22:51:04,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:04,930 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-03 22:51:04,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:51:04,959 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-03 22:51:04,960 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-03 22:51:04,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:04,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:04,965 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-03 22:51:04,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:51:05,132 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-03 22:51:05,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:05,138 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-03 22:51:05,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:05,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:05,153 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-03 22:51:05,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-02-03 22:51:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:05,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:05,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2018-02-03 22:51:05,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-03 22:51:05,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-03 22:51:05,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:05,258 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 34 states. [2018-02-03 22:51:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:05,896 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-03 22:51:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 22:51:05,897 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-02-03 22:51:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:05,898 INFO L225 Difference]: With dead ends: 190 [2018-02-03 22:51:05,898 INFO L226 Difference]: Without dead ends: 190 [2018-02-03 22:51:05,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2018-02-03 22:51:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-03 22:51:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2018-02-03 22:51:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-03 22:51:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-03 22:51:05,904 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 32 [2018-02-03 22:51:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:05,904 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-03 22:51:05,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-03 22:51:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-03 22:51:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:51:05,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:05,905 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:05,905 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 53168317, now seen corresponding path program 2 times [2018-02-03 22:51:05,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:05,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:05,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:05,906 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:05,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:05,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:05,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:05,990 INFO L213 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-03 22:51:05,997 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:06,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-03 22:51:06,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:06,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-03 22:51:06,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:51:06,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-02-03 22:51:06,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:51:06,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:51:06,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:06,047 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 12 states. [2018-02-03 22:51:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:06,172 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-02-03 22:51:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:51:06,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-03 22:51:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:06,173 INFO L225 Difference]: With dead ends: 162 [2018-02-03 22:51:06,173 INFO L226 Difference]: Without dead ends: 162 [2018-02-03 22:51:06,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 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-03 22:51:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-03 22:51:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2018-02-03 22:51:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-03 22:51:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-02-03 22:51:06,178 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 33 [2018-02-03 22:51:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:06,178 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-02-03 22:51:06,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:51:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-02-03 22:51:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:51:06,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:06,179 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-03 22:51:06,179 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1452172801, now seen corresponding path program 2 times [2018-02-03 22:51:06,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:06,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:06,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:06,180 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:06,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:06,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:06,484 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-03 22:51:06,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:06,484 INFO L213 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-03 22:51:06,490 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:06,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:06,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:06,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:06,516 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-03 22:51:06,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:06,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:06,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:06,529 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-03 22:51:06,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:06,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:06,536 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-03 22:51:06,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,539 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-03 22:51:06,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:51:06,566 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-03 22:51:06,568 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-03 22:51:06,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-02-03 22:51:06,591 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-03 22:51:06,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:51:06,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:06,600 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-03 22:51:06,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-02-03 22:51:06,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-03 22:51:06,731 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-03 22:51:06,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:06,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:06,752 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-03 22:51:06,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-02-03 22:51:06,804 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-03 22:51:06,808 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-03 22:51:06,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:06,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:06,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:06,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-02-03 22:51:06,886 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-03 22:51:06,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:06,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-03 22:51:06,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-03 22:51:06,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-03 22:51:06,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-02-03 22:51:06,915 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 29 states. [2018-02-03 22:51:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:07,493 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-02-03 22:51:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:51:07,493 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-02-03 22:51:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:07,494 INFO L225 Difference]: With dead ends: 161 [2018-02-03 22:51:07,494 INFO L226 Difference]: Without dead ends: 161 [2018-02-03 22:51:07,494 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-03 22:51:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-03 22:51:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-02-03 22:51:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-03 22:51:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-02-03 22:51:07,497 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 34 [2018-02-03 22:51:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:07,497 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-02-03 22:51:07,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-03 22:51:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-02-03 22:51:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:51:07,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:07,498 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, 1] [2018-02-03 22:51:07,498 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash 357476204, now seen corresponding path program 1 times [2018-02-03 22:51:07,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:07,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:07,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:07,499 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:07,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:07,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:07,659 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-03 22:51:07,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:07,659 INFO L213 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-03 22:51:07,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:07,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:07,684 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-03 22:51:07,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:07,689 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-03 22:51:07,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:07,692 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-03 22:51:07,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-02-03 22:51:07,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:07,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:07,717 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-03 22:51:07,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:07,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:07,725 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-03 22:51:07,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:07,739 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-03 22:51:07,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-03 22:51:07,902 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-03 22:51:07,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:07,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-03 22:51:07,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:51:07,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:51:07,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:51:07,919 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 28 states. [2018-02-03 22:51:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:08,547 INFO L93 Difference]: Finished difference Result 199 states and 228 transitions. [2018-02-03 22:51:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 22:51:08,547 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-02-03 22:51:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:08,548 INFO L225 Difference]: With dead ends: 199 [2018-02-03 22:51:08,548 INFO L226 Difference]: Without dead ends: 199 [2018-02-03 22:51:08,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:51:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-03 22:51:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-02-03 22:51:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-03 22:51:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-02-03 22:51:08,551 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 34 [2018-02-03 22:51:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:08,551 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-02-03 22:51:08,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:51:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-02-03 22:51:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:51:08,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:08,552 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-03 22:51:08,552 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash -679902947, now seen corresponding path program 1 times [2018-02-03 22:51:08,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:08,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:08,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:08,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:08,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:08,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:08,607 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-03 22:51:08,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:08,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:08,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:08,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:08,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:08,608 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2018-02-03 22:51:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:08,660 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-03 22:51:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:08,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-03 22:51:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:08,661 INFO L225 Difference]: With dead ends: 162 [2018-02-03 22:51:08,661 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 22:51:08,661 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-03 22:51:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 22:51:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-02-03 22:51:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-03 22:51:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-02-03 22:51:08,663 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-02-03 22:51:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:08,663 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-02-03 22:51:08,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-02-03 22:51:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:51:08,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:08,663 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:08,663 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1017556222, now seen corresponding path program 3 times [2018-02-03 22:51:08,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:08,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:08,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:08,664 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:08,664 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:08,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:09,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:09,088 INFO L213 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-03 22:51:09,093 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:51:09,108 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-03 22:51:09,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:09,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:09,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:09,129 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-03 22:51:09,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:51:09,165 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-03 22:51:09,167 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-03 22:51:09,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:09,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:09,172 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-03 22:51:09,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:51:09,452 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-03 22:51:09,466 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-03 22:51:09,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-03 22:51:09,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:09,504 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-03 22:51:09,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-02-03 22:51:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:09,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:09,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-02-03 22:51:09,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 22:51:09,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 22:51:09,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-02-03 22:51:09,669 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 40 states. [2018-02-03 22:51:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:10,702 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-02-03 22:51:10,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-03 22:51:10,703 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 36 [2018-02-03 22:51:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:10,703 INFO L225 Difference]: With dead ends: 151 [2018-02-03 22:51:10,703 INFO L226 Difference]: Without dead ends: 151 [2018-02-03 22:51:10,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=2868, Unknown=0, NotChecked=0, Total=3192 [2018-02-03 22:51:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-03 22:51:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2018-02-03 22:51:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 22:51:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-03 22:51:10,706 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 36 [2018-02-03 22:51:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:10,706 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-03 22:51:10,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-03 22:51:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-03 22:51:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:51:10,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:10,706 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:10,706 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1572046895, now seen corresponding path program 2 times [2018-02-03 22:51:10,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:10,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:10,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,707 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:10,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:10,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:10,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:10,932 INFO L213 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-03 22:51:10,937 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:10,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:10,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:10,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:10,961 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-03 22:51:10,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:10,966 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-03 22:51:10,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:10,972 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-03 22:51:10,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:51:11,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:11,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:11,005 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-03 22:51:11,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:11,011 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-03 22:51:11,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,016 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-03 22:51:11,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-03 22:51:11,047 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-03 22:51:11,048 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-03 22:51:11,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:11,053 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-03 22:51:11,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-03 22:51:11,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-03 22:51:11,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 14 [2018-02-03 22:51:11,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:11,126 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-03 22:51:11,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2018-02-03 22:51:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:11,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:11,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-02-03 22:51:11,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-03 22:51:11,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-03 22:51:11,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-03 22:51:11,332 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 35 states. [2018-02-03 22:51:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:12,204 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-03 22:51:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-03 22:51:12,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-02-03 22:51:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:12,204 INFO L225 Difference]: With dead ends: 163 [2018-02-03 22:51:12,204 INFO L226 Difference]: Without dead ends: 163 [2018-02-03 22:51:12,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=2508, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 22:51:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-03 22:51:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2018-02-03 22:51:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 22:51:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-03 22:51:12,207 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 38 [2018-02-03 22:51:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:12,207 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-03 22:51:12,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-03 22:51:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-03 22:51:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 22:51:12,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:12,207 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-03 22:51:12,207 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1543171285, now seen corresponding path program 3 times [2018-02-03 22:51:12,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:12,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:12,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:12,208 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:12,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:12,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:12,464 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-03 22:51:12,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:12,464 INFO L213 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-03 22:51:12,469 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:51:12,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:51:12,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:12,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:12,501 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-03 22:51:12,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,505 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-03 22:51:12,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:12,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:12,514 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-03 22:51:12,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,519 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-03 22:51:12,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,524 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-03 22:51:12,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:51:12,534 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-03 22:51:12,535 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-03 22:51:12,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-03 22:51:12,559 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-03 22:51:12,560 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-03 22:51:12,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,567 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-03 22:51:12,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-03 22:51:12,663 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-03 22:51:12,672 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-03 22:51:12,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:12,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:12,697 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-03 22:51:12,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-02-03 22:51:12,714 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-03 22:51:12,716 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-03 22:51:12,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:12,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-02-03 22:51:12,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-03 22:51:12,757 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-03 22:51:12,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:12,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:12,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:12,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-03 22:51:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:12,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:12,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-02-03 22:51:12,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-03 22:51:12,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-03 22:51:12,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-03 22:51:12,850 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 25 states. [2018-02-03 22:51:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:13,336 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-03 22:51:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:51:13,336 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-02-03 22:51:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:13,337 INFO L225 Difference]: With dead ends: 123 [2018-02-03 22:51:13,337 INFO L226 Difference]: Without dead ends: 93 [2018-02-03 22:51:13,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 22:51:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-03 22:51:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-02-03 22:51:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-03 22:51:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-02-03 22:51:13,338 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 39 [2018-02-03 22:51:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:13,339 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-02-03 22:51:13,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-03 22:51:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-02-03 22:51:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 22:51:13,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:13,339 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:13,339 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -11114239, now seen corresponding path program 4 times [2018-02-03 22:51:13,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:13,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:13,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:13,340 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:13,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:13,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:13,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:13,948 INFO L213 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-03 22:51:13,952 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:51:13,967 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:51:13,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:13,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:13,990 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-03 22:51:13,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:13,993 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-03 22:51:13,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:51:14,026 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-03 22:51:14,027 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-03 22:51:14,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:14,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:14,032 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-03 22:51:14,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:51:15,203 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-03 22:51:15,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:15,245 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-03 22:51:15,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:15,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:15,298 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-03 22:51:15,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-02-03 22:51:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:15,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:15,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45 [2018-02-03 22:51:15,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-03 22:51:15,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-03 22:51:15,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1839, Unknown=1, NotChecked=0, Total=2070 [2018-02-03 22:51:15,513 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 46 states. [2018-02-03 22:51:16,300 WARN L146 SmtUtils]: Spent 518ms on a formula simplification. DAG size of input: 74 DAG size of output 34 [2018-02-03 22:51:16,994 WARN L146 SmtUtils]: Spent 541ms on a formula simplification. DAG size of input: 60 DAG size of output 39 [2018-02-03 22:51:18,128 WARN L146 SmtUtils]: Spent 519ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-03 22:51:18,639 WARN L146 SmtUtils]: Spent 473ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-03 22:51:19,375 WARN L146 SmtUtils]: Spent 527ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-02-03 22:51:20,140 WARN L146 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-02-03 22:51:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:21,336 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-03 22:51:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 22:51:21,336 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 40 [2018-02-03 22:51:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:21,337 INFO L225 Difference]: With dead ends: 124 [2018-02-03 22:51:21,337 INFO L226 Difference]: Without dead ends: 124 [2018-02-03 22:51:21,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=550, Invalid=4279, Unknown=1, NotChecked=0, Total=4830 [2018-02-03 22:51:21,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-03 22:51:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2018-02-03 22:51:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-03 22:51:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-03 22:51:21,340 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2018-02-03 22:51:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:21,340 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-03 22:51:21,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-03 22:51:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-03 22:51:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-03 22:51:21,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:21,341 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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-03 22:51:21,341 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash 862211954, now seen corresponding path program 3 times [2018-02-03 22:51:21,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:21,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:21,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:21,342 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:21,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:21,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:21,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:21,944 INFO L213 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-03 22:51:21,949 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:51:21,972 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:51:21,972 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:21,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:22,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:22,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:22,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:22,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:51:22,096 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-03 22:51:22,097 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-03 22:51:22,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:22,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:22,105 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-03 22:51:22,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:51:22,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-02-03 22:51:22,510 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-03 22:51:22,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-03 22:51:22,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:22,551 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-03 22:51:22,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:67 [2018-02-03 22:51:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:22,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:22,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2018-02-03 22:51:22,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 22:51:22,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 22:51:22,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1671, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:51:22,755 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-02-03 22:51:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:24,049 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-03 22:51:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-03 22:51:24,049 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-02-03 22:51:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:24,049 INFO L225 Difference]: With dead ends: 119 [2018-02-03 22:51:24,049 INFO L226 Difference]: Without dead ends: 119 [2018-02-03 22:51:24,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=415, Invalid=3875, Unknown=0, NotChecked=0, Total=4290 [2018-02-03 22:51:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-03 22:51:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-02-03 22:51:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-03 22:51:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-03 22:51:24,052 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 42 [2018-02-03 22:51:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:24,052 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-03 22:51:24,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 22:51:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-03 22:51:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:51:24,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:24,052 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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-03 22:51:24,052 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1458979531, now seen corresponding path program 4 times [2018-02-03 22:51:24,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:24,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:24,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:24,053 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:24,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:24,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:25,098 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-03 22:51:25,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:25,099 INFO L213 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-03 22:51:25,104 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:51:25,118 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:51:25,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:25,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:25,124 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-03 22:51:25,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,134 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-03 22:51:25,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,142 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-03 22:51:25,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,143 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-03 22:51:25,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,152 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-03 22:51:25,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41 [2018-02-03 22:51:25,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,213 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-03 22:51:25,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,226 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-03 22:51:25,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,242 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-03 22:51:25,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:25,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03 22:51:25,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,265 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-03 22:51:25,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40 [2018-02-03 22:51:25,329 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-03 22:51:25,330 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-03 22:51:25,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,346 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-03 22:51:25,347 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-03 22:51:25,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:25,358 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-03 22:51:25,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-02-03 22:51:26,498 WARN L143 SmtUtils]: Spent 902ms on a formula simplification that was a NOOP. DAG size: 45 [2018-02-03 22:51:27,324 WARN L143 SmtUtils]: Spent 779ms on a formula simplification that was a NOOP. DAG size: 48 [2018-02-03 22:51:28,440 WARN L143 SmtUtils]: Spent 431ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-03 22:51:30,130 WARN L143 SmtUtils]: Spent 1636ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-03 22:51:30,147 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-03 22:51:30,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,168 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-03 22:51:30,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:30,215 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-03 22:51:30,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:30,223 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-03 22:51:30,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:30,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:30,298 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-03 22:51:30,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278 [2018-02-03 22:51:30,757 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-03 22:51:30,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:30,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-02-03 22:51:30,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-03 22:51:30,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-03 22:51:30,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2128, Unknown=1, NotChecked=0, Total=2256 [2018-02-03 22:51:30,776 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 48 states. [2018-02-03 22:51:34,104 WARN L146 SmtUtils]: Spent 2862ms on a formula simplification. DAG size of input: 133 DAG size of output 67 [2018-02-03 22:51:35,850 WARN L146 SmtUtils]: Spent 1704ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-02-03 22:51:39,695 WARN L146 SmtUtils]: Spent 3783ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-03 22:51:40,965 WARN L146 SmtUtils]: Spent 387ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-02-03 22:51:43,831 WARN L146 SmtUtils]: Spent 1968ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-03 22:51:44,368 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 125 DAG size of output 88 [2018-02-03 22:51:50,783 WARN L146 SmtUtils]: Spent 6309ms on a formula simplification. DAG size of input: 138 DAG size of output 94 [2018-02-03 22:51:52,808 WARN L146 SmtUtils]: Spent 1951ms on a formula simplification. DAG size of input: 126 DAG size of output 88 [2018-02-03 22:51:59,955 WARN L146 SmtUtils]: Spent 6296ms on a formula simplification. DAG size of input: 120 DAG size of output 102 [2018-02-03 22:52:00,973 WARN L146 SmtUtils]: Spent 940ms on a formula simplification. DAG size of input: 131 DAG size of output 110 [2018-02-03 22:52:01,964 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 117 DAG size of output 94 [2018-02-03 22:52:02,665 WARN L146 SmtUtils]: Spent 508ms on a formula simplification. DAG size of input: 85 DAG size of output 64 [2018-02-03 22:52:04,724 WARN L146 SmtUtils]: Spent 1948ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-02-03 22:52:05,166 WARN L146 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 95 DAG size of output 78 [2018-02-03 22:52:05,976 WARN L146 SmtUtils]: Spent 626ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-02-03 22:52:06,790 WARN L146 SmtUtils]: Spent 733ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-02-03 22:52:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:07,045 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-03 22:52:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 22:52:07,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-02-03 22:52:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:07,046 INFO L225 Difference]: With dead ends: 125 [2018-02-03 22:52:07,046 INFO L226 Difference]: Without dead ends: 125 [2018-02-03 22:52:07,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=408, Invalid=5140, Unknown=2, NotChecked=0, Total=5550 [2018-02-03 22:52:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-03 22:52:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-03 22:52:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-03 22:52:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-03 22:52:07,049 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-02-03 22:52:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:07,049 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-03 22:52:07,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-03 22:52:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-03 22:52:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 22:52:07,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:07,050 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:07,050 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash -839682937, now seen corresponding path program 5 times [2018-02-03 22:52:07,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:07,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:07,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:07,051 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:07,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:07,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:08,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:08,189 INFO L213 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-03 22:52:08,194 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:52:08,216 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-03 22:52:08,216 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:08,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:08,236 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-03 22:52:08,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:08,240 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-03 22:52:08,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:52:08,279 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-03 22:52:08,280 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-03 22:52:08,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:08,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:08,284 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-03 22:52:08,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:52:09,034 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-03 22:52:09,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:09,056 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-03 22:52:09,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:52:09,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:09,144 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-03 22:52:09,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-02-03 22:52:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:09,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:09,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 57 [2018-02-03 22:52:09,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-03 22:52:09,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-03 22:52:09,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2903, Unknown=0, NotChecked=0, Total=3306 [2018-02-03 22:52:09,341 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 58 states. [2018-02-03 22:52:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:13,885 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-02-03 22:52:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-03 22:52:13,885 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 48 [2018-02-03 22:52:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:13,885 INFO L225 Difference]: With dead ends: 184 [2018-02-03 22:52:13,885 INFO L226 Difference]: Without dead ends: 184 [2018-02-03 22:52:13,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=979, Invalid=7577, Unknown=0, NotChecked=0, Total=8556 [2018-02-03 22:52:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-03 22:52:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2018-02-03 22:52:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:52:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-03 22:52:13,891 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 48 [2018-02-03 22:52:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:13,891 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-03 22:52:13,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-03 22:52:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-03 22:52:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-03 22:52:13,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:13,892 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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-03 22:52:13,892 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -823357064, now seen corresponding path program 5 times [2018-02-03 22:52:13,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:13,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:13,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:13,893 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:13,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:13,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:14,491 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 105 DAG size of output 32 [2018-02-03 22:52:14,607 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 117 DAG size of output 62 [2018-02-03 22:52:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:15,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:15,549 INFO L213 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-03 22:52:15,554 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:52:15,570 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-03 22:52:15,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:15,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:15,577 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-03 22:52:15,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:52:15,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,587 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-03 22:52:15,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:25 [2018-02-03 22:52:15,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:15,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:15,642 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-03 22:52:15,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:15,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:15,651 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-03 22:52:15,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,655 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-03 22:52:15,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-02-03 22:52:15,710 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-03 22:52:15,711 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-03 22:52:15,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:15,717 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-03 22:52:15,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-03 22:52:16,181 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-03 22:52:16,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:16,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:16,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:16,211 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-03 22:52:16,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:52:16,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:16,235 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-03 22:52:16,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:151 [2018-02-03 22:52:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:16,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:16,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2018-02-03 22:52:16,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-03 22:52:16,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-03 22:52:16,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2514, Unknown=0, NotChecked=0, Total=2652 [2018-02-03 22:52:16,539 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 52 states. [2018-02-03 22:52:17,101 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 106 DAG size of output 48 [2018-02-03 22:52:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:19,008 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2018-02-03 22:52:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-03 22:52:19,008 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 50 [2018-02-03 22:52:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:19,009 INFO L225 Difference]: With dead ends: 180 [2018-02-03 22:52:19,009 INFO L226 Difference]: Without dead ends: 180 [2018-02-03 22:52:19,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=356, Invalid=5344, Unknown=0, NotChecked=0, Total=5700 [2018-02-03 22:52:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-03 22:52:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 147. [2018-02-03 22:52:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:52:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-03 22:52:19,012 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 50 [2018-02-03 22:52:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:19,012 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-03 22:52:19,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-03 22:52:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-03 22:52:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-03 22:52:19,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:19,013 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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-03 22:52:19,013 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -487224261, now seen corresponding path program 6 times [2018-02-03 22:52:19,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:19,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:19,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:19,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:19,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:19,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:20,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:20,180 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:52:20,185 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 22:52:20,214 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-03 22:52:20,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:20,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:20,286 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-03 22:52:20,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-03 22:52:20,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:20,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:20,357 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-03 22:52:20,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:52:20,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,368 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-03 22:52:20,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2018-02-03 22:52:20,435 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-03 22:52:20,436 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-03 22:52:20,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,443 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-03 22:52:20,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-03 22:52:20,484 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-03 22:52:20,485 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-03 22:52:20,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:20,505 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-03 22:52:20,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-02-03 22:52:21,670 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 69 treesize of output 57 [2018-02-03 22:52:21,674 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-03 22:52:21,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:52:21,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2018-02-03 22:52:21,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:21,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:21,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:21,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:89, output treesize:77 [2018-02-03 22:52:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:21,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:21,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2018-02-03 22:52:21,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-03 22:52:21,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-03 22:52:21,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2018-02-03 22:52:21,891 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 63 states. [2018-02-03 22:52:22,867 WARN L146 SmtUtils]: Spent 566ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-02-03 22:52:27,471 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 115 DAG size of output 109 [2018-02-03 22:52:29,661 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 122 DAG size of output 113 [2018-02-03 22:52:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:30,730 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2018-02-03 22:52:30,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-03 22:52:30,731 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 54 [2018-02-03 22:52:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:30,731 INFO L225 Difference]: With dead ends: 167 [2018-02-03 22:52:30,731 INFO L226 Difference]: Without dead ends: 167 [2018-02-03 22:52:30,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=442, Invalid=7927, Unknown=3, NotChecked=0, Total=8372 [2018-02-03 22:52:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-03 22:52:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2018-02-03 22:52:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:52:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-03 22:52:30,734 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 54 [2018-02-03 22:52:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:30,734 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-03 22:52:30,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-03 22:52:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-03 22:52:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-03 22:52:30,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:30,735 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:30,735 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 542921114, now seen corresponding path program 7 times [2018-02-03 22:52:30,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:30,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:30,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:30,736 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:30,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:30,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 22:52:31,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:31,243 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:52:31,247 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:52:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:31,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:31,282 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-03 22:52:31,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,288 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-03 22:52:31,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,291 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-03 22:52:31,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:52:31,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:31,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:31,325 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-03 22:52:31,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:31,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:31,333 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-03 22:52:31,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,337 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-03 22:52:31,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-03 22:52:31,372 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-03 22:52:31,373 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-03 22:52:31,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:31,377 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-03 22:52:31,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-03 22:52:31,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-02-03 22:52:31,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:31,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-02-03 22:52:31,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:52:31,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:31,546 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-03 22:52:31,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-02-03 22:52:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:31,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:31,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-02-03 22:52:31,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-03 22:52:31,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-03 22:52:31,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2020, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:52:31,850 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 47 states. [2018-02-03 22:52:33,423 WARN L146 SmtUtils]: Spent 399ms on a formula simplification. DAG size of input: 68 DAG size of output 61 [2018-02-03 22:52:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:34,523 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-03 22:52:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 22:52:34,524 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2018-02-03 22:52:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:34,524 INFO L225 Difference]: With dead ends: 189 [2018-02-03 22:52:34,524 INFO L226 Difference]: Without dead ends: 159 [2018-02-03 22:52:34,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=468, Invalid=5383, Unknown=1, NotChecked=0, Total=5852 [2018-02-03 22:52:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-03 22:52:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2018-02-03 22:52:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:52:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-03 22:52:34,526 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 57 [2018-02-03 22:52:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:34,526 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-03 22:52:34,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-03 22:52:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-03 22:52:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-03 22:52:34,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:34,527 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 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-03 22:52:34,527 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2136117890, now seen corresponding path program 8 times [2018-02-03 22:52:34,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:34,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:34,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:34,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:52:34,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:34,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:35,258 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 154 DAG size of output 103 [2018-02-03 22:52:35,441 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-02-03 22:52:35,630 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-02-03 22:52:35,824 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 129 DAG size of output 84 [2018-02-03 22:52:36,012 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 127 DAG size of output 82 [2018-02-03 22:52:36,228 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 150 DAG size of output 93 [2018-02-03 22:52:36,447 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 152 DAG size of output 93 [2018-02-03 22:52:36,667 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 150 DAG size of output 90 [2018-02-03 22:52:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:37,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:37,634 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:52:37,639 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:52:37,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:52:37,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:37,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:37,664 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-03 22:52:37,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,668 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-03 22:52:37,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,671 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-03 22:52:37,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:52:37,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:37,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:37,731 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-03 22:52:37,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:37,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:37,742 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-03 22:52:37,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,752 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-03 22:52:37,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-03 22:52:37,814 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-03 22:52:37,815 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-03 22:52:37,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:37,819 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-03 22:52:37,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-03 22:52:38,636 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 57 treesize of output 43 [2018-02-03 22:52:38,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:38,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:38,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:38,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:38,650 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 43 treesize of output 81 [2018-02-03 22:52:38,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:52:38,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:38,690 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-03 22:52:38,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:205 [2018-02-03 22:52:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:39,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:39,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 65 [2018-02-03 22:52:39,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-03 22:52:39,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-03 22:52:39,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=4070, Unknown=0, NotChecked=0, Total=4290 [2018-02-03 22:52:39,069 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 66 states. [2018-02-03 22:52:39,820 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 208 DAG size of output 43 [2018-02-03 22:52:42,462 WARN L146 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 179 DAG size of output 79 [2018-02-03 22:52:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:44,499 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-02-03 22:52:44,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-03 22:52:44,499 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 58 [2018-02-03 22:52:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:44,500 INFO L225 Difference]: With dead ends: 193 [2018-02-03 22:52:44,500 INFO L226 Difference]: Without dead ends: 193 [2018-02-03 22:52:44,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=915, Invalid=11967, Unknown=0, NotChecked=0, Total=12882 [2018-02-03 22:52:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-03 22:52:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 147. [2018-02-03 22:52:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:52:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-03 22:52:44,502 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 58 [2018-02-03 22:52:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:44,503 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-03 22:52:44,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-03 22:52:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-03 22:52:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-03 22:52:44,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:44,504 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:44,504 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2144926456, now seen corresponding path program 9 times [2018-02-03 22:52:44,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:44,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:44,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:44,505 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:44,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:44,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:46,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:46,089 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:52:46,096 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:52:46,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-03 22:52:46,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:46,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:46,140 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-03 22:52:46,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,145 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-03 22:52:46,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,149 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-03 22:52:46,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:52:46,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:46,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:46,203 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-03 22:52:46,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:46,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:52:46,213 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-03 22:52:46,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,218 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-03 22:52:46,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-03 22:52:46,273 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-03 22:52:46,274 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-03 22:52:46,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:46,280 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-03 22:52:46,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-02-03 22:52:47,457 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-03 22:52:47,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 89 [2018-02-03 22:52:47,483 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-03 22:52:47,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-02-03 22:52:47,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:47,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:52:47,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:233 [2018-02-03 22:52:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:48,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:52:48,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-02-03 22:52:48,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-03 22:52:48,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-03 22:52:48,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3076, Unknown=1, NotChecked=0, Total=3306 [2018-02-03 22:52:48,085 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 58 states. [2018-02-03 22:52:48,834 WARN L146 SmtUtils]: Spent 451ms on a formula simplification. DAG size of input: 57 DAG size of output 24 [2018-02-03 22:52:49,619 WARN L146 SmtUtils]: Spent 410ms on a formula simplification. DAG size of input: 142 DAG size of output 46 [2018-02-03 22:52:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:51,875 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2018-02-03 22:52:51,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-03 22:52:51,875 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 60 [2018-02-03 22:52:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:51,875 INFO L225 Difference]: With dead ends: 214 [2018-02-03 22:52:51,875 INFO L226 Difference]: Without dead ends: 214 [2018-02-03 22:52:51,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3351 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=989, Invalid=10352, Unknown=1, NotChecked=0, Total=11342 [2018-02-03 22:52:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-03 22:52:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 167. [2018-02-03 22:52:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-03 22:52:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-03 22:52:51,879 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 60 [2018-02-03 22:52:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:51,879 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-03 22:52:51,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-03 22:52:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-03 22:52:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-03 22:52:51,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:51,880 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:51,880 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:52:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1237788269, now seen corresponding path program 6 times [2018-02-03 22:52:51,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:51,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:51,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:51,881 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:51,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:51,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:53,091 WARN L146 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 374 DAG size of output 85 [2018-02-03 22:52:53,389 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 309 DAG size of output 74 [2018-02-03 22:52:53,732 WARN L146 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 309 DAG size of output 74 [2018-02-03 22:52:54,084 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 311 DAG size of output 74 [2018-02-03 22:52:54,434 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 309 DAG size of output 72 [2018-02-03 22:52:54,792 WARN L146 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 326 DAG size of output 83 [2018-02-03 22:52:55,159 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 328 DAG size of output 83 [2018-02-03 22:52:55,524 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 326 DAG size of output 81 [2018-02-03 22:52:55,795 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 220 DAG size of output 72 [2018-02-03 22:52:56,065 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 222 DAG size of output 72 [2018-02-03 22:52:56,335 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 220 DAG size of output 70 [2018-02-03 22:52:56,490 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 145 DAG size of output 64 [2018-02-03 22:52:56,651 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 147 DAG size of output 64 [2018-02-03 22:52:56,810 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 145 DAG size of output 62 [2018-02-03 22:52:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:57,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:52:57,947 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:52:57,953 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 22:52:57,994 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-02-03 22:52:57,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:52:57,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:52:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:52:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:58,029 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-03 22:52:58,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-03 22:52:58,084 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-03 22:52:58,085 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-03 22:52:58,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:52:58,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:52:58,089 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-03 22:52:58,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-03 22:53:40,097 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 89 treesize of output 67 [2018-02-03 22:53:40,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 19 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 67 treesize of output 453 [2018-02-03 22:53:40,382 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 45 Received shutdown request... [2018-02-03 22:53:54,141 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 22:53:54,141 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 22:53:54,144 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 22:53:54,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:53:54 BoogieIcfgContainer [2018-02-03 22:53:54,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:53:54,145 INFO L168 Benchmark]: Toolchain (without parser) took 177394.03 ms. Allocated memory was 404.8 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 358.8 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-03 22:53:54,146 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:53:54,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:53:54,147 INFO L168 Benchmark]: Boogie Preprocessor took 27.58 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:53:54,147 INFO L168 Benchmark]: RCFGBuilder took 221.32 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 327.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:53:54,147 INFO L168 Benchmark]: TraceAbstraction took 176986.35 ms. Allocated memory was 404.8 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 327.0 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-03 22:53:54,148 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.13 ms. Allocated memory is still 404.8 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.58 ms. Allocated memory is still 404.8 MB. Free memory was 348.2 MB in the beginning and 346.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 221.32 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 327.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176986.35 ms. Allocated memory was 404.8 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 327.0 MB in the beginning and 1.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 176.9s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 79.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1156 SDtfs, 3283 SDslu, 12033 SDs, 0 SdLazy, 15927 SolverSat, 1357 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1816 GetRequests, 507 SyntacticMatches, 17 SemanticMatches, 1292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22683 ImplicationChecksByTransitivity, 91.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=35, 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, 35 MinimizatonAttempts, 550 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 1941 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 1886 ConstructedInterpolants, 223 QuantifiedInterpolants, 1799920 SizeOfPredicates, 292 NumberOfNonLiveVariables, 3690 ConjunctsInSsa, 1186 ConjunctsInUnsatCore, 55 InterpolantComputations, 17 PerfectInterpolantSequences, 53/1499 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/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-53-54-154.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-53-54-154.csv Completed graceful shutdown