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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:47:23,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:47:23,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:47:23,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:47:23,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:47:23,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:47:23,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:47:23,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:47:23,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:47:23,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:47:23,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:47:23,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:47:23,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:47:23,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:47:23,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:47:23,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:47:23,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:47:23,613 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:47:23,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:47:23,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:47:23,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:47:23,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:47:23,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:47:23,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:47:23,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:47:23,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:47:23,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:47:23,619 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:47:23,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:47:23,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:47:23,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:47:23,620 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:47:23,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:47:23,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:47:23,629 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:47:23,629 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:47:23,629 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:47:23,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:47:23,630 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:47:23,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:47:23,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:47:23,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:47:23,632 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:47:23,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:47:23,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:47:23,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:47:23,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:47:23,667 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:47:23,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:23,779 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:47:23,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:47:23,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:23,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:47:23,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:47:23,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454f3215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23, skipping insertion in model container [2018-02-03 22:47:23,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,804 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:23,834 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:23,910 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:23,922 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:23,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23 WrapperNode [2018-02-03 22:47:23,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:23,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:47:23,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:47:23,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:47:23,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (1/1) ... [2018-02-03 22:47:23,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:47:23,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:47:23,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:47:23,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:47:23,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (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:47:23,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:47:23,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:47:23,987 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-03 22:47:23,987 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:47:23,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:47:23,988 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-03 22:47:23,988 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:47:23,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:47:23,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:47:24,143 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:47:24,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:24 BoogieIcfgContainer [2018-02-03 22:47:24,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:47:24,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:47:24,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:47:24,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:47:24,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:47:23" (1/3) ... [2018-02-03 22:47:24,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e55047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:24, skipping insertion in model container [2018-02-03 22:47:24,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:23" (2/3) ... [2018-02-03 22:47:24,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e55047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:24, skipping insertion in model container [2018-02-03 22:47:24,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:24" (3/3) ... [2018-02-03 22:47:24,149 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:24,154 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:47:24,159 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:47:24,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:47:24,191 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:47:24,192 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:47:24,192 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:47:24,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:47:24,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:47:24,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:47:24,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:47:24,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:47:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-03 22:47:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:24,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:24,211 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:24,211 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-03 22:47:24,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:24,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:24,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:24,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:24,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:24,398 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:47:24,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:24,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:24,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:24,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:24,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:24,414 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-03 22:47:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:24,562 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-03 22:47:24,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:24,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:47:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:24,571 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:47:24,571 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:47:24,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:47:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:47:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:47:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-03 22:47:24,601 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-03 22:47:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:24,601 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-03 22:47:24,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-03 22:47:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:24,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:24,602 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:24,602 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-03 22:47:24,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:24,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:24,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:24,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:24,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:24,693 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:47:24,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:24,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:24,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:24,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:24,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:24,696 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-03 22:47:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:24,744 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-03 22:47:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:24,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:47:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:24,745 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:47:24,745 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:47:24,746 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:47:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:47:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 22:47:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:47:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-03 22:47:24,751 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-03 22:47:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:24,751 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-03 22:47:24,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-03 22:47:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:24,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:24,752 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:24,752 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-03 22:47:24,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:24,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:24,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:24,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:24,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:24,786 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:47:24,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:24,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:24,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:24,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:24,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:24,787 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-03 22:47:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:24,826 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-03 22:47:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:24,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:47:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:24,827 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:47:24,827 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:47:24,827 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:47:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:47:24,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:47:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:47:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-03 22:47:24,829 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-03 22:47:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:24,830 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-03 22:47:24,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-03 22:47:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:24,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:24,830 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:24,830 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:24,830 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-03 22:47:24,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:24,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:24,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,831 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:24,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:24,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:24,888 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:47:24,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:24,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:24,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:24,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:24,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:24,889 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-03 22:47:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:24,922 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-03 22:47:24,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:24,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:47:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:24,925 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:47:24,925 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:47:24,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:47:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:47:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:47:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-03 22:47:24,929 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-03 22:47:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:24,929 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-03 22:47:24,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-03 22:47:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:47:24,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:24,930 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:24,930 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-03 22:47:24,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:24,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:24,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,931 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:24,931 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:24,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:24,969 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:47:24,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:24,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:24,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:24,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:24,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:24,971 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-03 22:47:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,031 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-03 22:47:25,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:25,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 22:47:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,032 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:47:25,032 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:47:25,033 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:47:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:47:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:47:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:47:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-03 22:47:25,036 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-03 22:47:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,036 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-03 22:47:25,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-03 22:47:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:47:25,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,037 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:25,037 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-03 22:47:25,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,110 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:47:25,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:47:25,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:47:25,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:47:25,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:25,112 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-03 22:47:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,212 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-03 22:47:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:25,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-03 22:47:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,215 INFO L225 Difference]: With dead ends: 73 [2018-02-03 22:47:25,215 INFO L226 Difference]: Without dead ends: 73 [2018-02-03 22:47:25,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:25,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-03 22:47:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-03 22:47:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:47:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-03 22:47:25,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-03 22:47:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,218 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-03 22:47:25,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:47:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-03 22:47:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:25,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,218 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] [2018-02-03 22:47:25,218 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,218 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-03 22:47:25,219 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,252 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:47:25,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:25,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:25,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:25,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:25,254 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-03 22:47:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,316 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-03 22:47:25,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:25,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:47:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,316 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:47:25,317 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:47:25,317 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:47:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:47:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-03 22:47:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:47:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-03 22:47:25,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-03 22:47:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,319 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-03 22:47:25,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-03 22:47:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:25,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,320 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] [2018-02-03 22:47:25,320 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-03 22:47:25,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,395 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:47:25,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:25,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:25,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:25,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:25,396 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-03 22:47:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,484 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-03 22:47:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:25,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-03 22:47:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,485 INFO L225 Difference]: With dead ends: 67 [2018-02-03 22:47:25,485 INFO L226 Difference]: Without dead ends: 67 [2018-02-03 22:47:25,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-03 22:47:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-03 22:47:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 22:47:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-03 22:47:25,489 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-03 22:47:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,490 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-03 22:47:25,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-03 22:47:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:47:25,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,491 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] [2018-02-03 22:47:25,491 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-03 22:47:25,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,594 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:47:25,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:47:25,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:47:25,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:47:25,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:47:25,596 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-02-03 22:47:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,679 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-03 22:47:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:25,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-03 22:47:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,679 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:47:25,680 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:47:25,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:47:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:47:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:47:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-03 22:47:25,682 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-03 22:47:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,683 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-03 22:47:25,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:47:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-03 22:47:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:47:25,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,684 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, 1, 1, 1, 1] [2018-02-03 22:47:25,684 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-03 22:47:25,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,685 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,731 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:47:25,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:25,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:47:25,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:47:25,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:25,732 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-03 22:47:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:25,736 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-03 22:47:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:47:25,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-03 22:47:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:25,737 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:47:25,737 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:47:25,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:47:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:47:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:47:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-03 22:47:25,740 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-03 22:47:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:25,741 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-03 22:47:25,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:47:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-03 22:47:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:47:25,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:25,742 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, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:25,742 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-03 22:47:25,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:25,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:25,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:25,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:25,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 22:47:25,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:25,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:47:25,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:47:25,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:47:25,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:47:25,912 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-03 22:47:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:26,155 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-03 22:47:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:47:26,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-03 22:47:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:26,156 INFO L225 Difference]: With dead ends: 62 [2018-02-03 22:47:26,157 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:47:26,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:47:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:47:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:47:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:47:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-03 22:47:26,160 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-03 22:47:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:26,160 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-03 22:47:26,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:47:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-03 22:47:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:47:26,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:26,161 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, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:26,161 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:26,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-03 22:47:26,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:26,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:26,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:26,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:26,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:26,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:26,297 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:47:26,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:26,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:47:26,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:47:26,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:47:26,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:47:26,297 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-03 22:47:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:26,436 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-03 22:47:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:47:26,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-03 22:47:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:26,437 INFO L225 Difference]: With dead ends: 77 [2018-02-03 22:47:26,437 INFO L226 Difference]: Without dead ends: 77 [2018-02-03 22:47:26,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:47:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-03 22:47:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-03 22:47:26,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 22:47:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-03 22:47:26,441 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-03 22:47:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:26,441 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-03 22:47:26,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:47:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-03 22:47:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:47:26,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:26,442 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, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:26,442 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-03 22:47:26,443 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:26,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:26,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:26,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:26,444 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:26,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:26,610 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:47:26,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:26,610 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:47:26,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:26,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:26,708 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:47:26,710 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:47:26,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:26,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:26,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:47:26,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:47:26,821 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:47:26,828 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:47:26,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:26,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:26,840 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:47:26,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-03 22:47:26,915 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:47:26,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:26,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-03 22:47:26,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 22:47:26,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 22:47:26,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-03 22:47:26,941 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-02-03 22:47:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:27,545 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-03 22:47:27,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:47:27,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-02-03 22:47:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:27,546 INFO L225 Difference]: With dead ends: 103 [2018-02-03 22:47:27,546 INFO L226 Difference]: Without dead ends: 103 [2018-02-03 22:47:27,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:47:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-03 22:47:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-03 22:47:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-03 22:47:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-03 22:47:27,551 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-03 22:47:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:27,551 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-03 22:47:27,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 22:47:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-03 22:47:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:47:27,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:27,553 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:27,553 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-03 22:47:27,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:27,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:27,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:27,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:27,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:27,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:27,760 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:47:27,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:27,760 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:47:27,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:27,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:27,785 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:47:27,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:47:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:27,810 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:47:27,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:47:27,833 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:47:27,834 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:47:27,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,840 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:47:27,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:47:27,869 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:47:27,871 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:47:27,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,881 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:47:27,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:47:27,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-03 22:47:27,969 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:47:27,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:27,978 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:47:27,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:27,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:27,990 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:47:27,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-02-03 22:47:28,034 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:47:28,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:28,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-02-03 22:47:28,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:47:28,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:47:28,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:47:28,057 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 23 states. [2018-02-03 22:47:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:28,594 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2018-02-03 22:47:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:47:28,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-02-03 22:47:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:28,596 INFO L225 Difference]: With dead ends: 170 [2018-02-03 22:47:28,596 INFO L226 Difference]: Without dead ends: 170 [2018-02-03 22:47:28,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:47:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-03 22:47:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2018-02-03 22:47:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-03 22:47:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-02-03 22:47:28,600 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 31 [2018-02-03 22:47:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:28,600 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-02-03 22:47:28,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:47:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-02-03 22:47:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 22:47:28,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:28,601 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:28,602 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-03 22:47:28,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:28,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:28,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:28,603 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:28,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:28,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:28,861 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:47:28,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:28,861 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:47:28,872 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:28,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:28,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:28,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:28,916 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:47:28,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:28,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:28,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:47:28,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 16 treesize of output 13 [2018-02-03 22:47:28,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 13 treesize of output 12 [2018-02-03 22:47:28,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:28,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:28,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:28,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-03 22:47:29,108 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 20 treesize of output 16 [2018-02-03 22:47:29,112 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:47:29,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:29,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:29,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:47:29,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-02-03 22:47:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:29,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:29,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-03 22:47:29,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:47:29,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:47:29,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:47:29,268 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 24 states. [2018-02-03 22:47:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:30,164 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2018-02-03 22:47:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:47:30,164 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-03 22:47:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:30,165 INFO L225 Difference]: With dead ends: 176 [2018-02-03 22:47:30,165 INFO L226 Difference]: Without dead ends: 176 [2018-02-03 22:47:30,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2018-02-03 22:47:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-03 22:47:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 92. [2018-02-03 22:47:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-03 22:47:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-02-03 22:47:30,169 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 37 [2018-02-03 22:47:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:30,169 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-02-03 22:47:30,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:47:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-02-03 22:47:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 22:47:30,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:30,171 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:30,171 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:47:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1598751668, now seen corresponding path program 2 times [2018-02-03 22:47:30,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:30,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:30,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:30,172 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:30,172 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:30,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:30,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:30,440 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:47:30,453 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:30,468 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:30,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:30,470 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:30,473 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:47:30,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,484 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:47:30,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:47:30,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:30,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:30,524 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:47:30,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,539 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:47:30,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:47:30,575 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:47:30,576 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:47:30,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-03 22:47:30,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-03 22:47:30,604 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:47:30,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,611 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:47:30,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-03 22:47:30,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-02-03 22:47:30,753 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:47:30,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:30,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:47:30,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:30,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:30,766 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:47:30,766 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-02-03 22:47:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:30,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:30,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-02-03 22:47:30,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:47:30,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:47:30,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:47:30,825 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 23 states. [2018-02-03 22:47:33,358 WARN L146 SmtUtils]: Spent 2022ms on a formula simplification. DAG size of input: 56 DAG size of output 45 [2018-02-03 22:47:36,720 WARN L146 SmtUtils]: Spent 3200ms on a formula simplification. DAG size of input: 64 DAG size of output 51 [2018-02-03 22:47:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:36,831 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-02-03 22:47:36,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:47:36,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-02-03 22:47:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:36,833 INFO L225 Difference]: With dead ends: 111 [2018-02-03 22:47:36,833 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:47:36,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 22:47:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:47:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:47:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:47:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:47:36,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-02-03 22:47:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:36,834 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:47:36,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:47:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:47:36,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:47:36,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:47:36 BoogieIcfgContainer [2018-02-03 22:47:36,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:47:36,840 INFO L168 Benchmark]: Toolchain (without parser) took 13060.34 ms. Allocated memory was 399.0 MB in the beginning and 746.1 MB in the end (delta: 347.1 MB). Free memory was 357.2 MB in the beginning and 452.9 MB in the end (delta: -95.8 MB). Peak memory consumption was 251.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:36,841 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:47:36,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.87 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.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:47:36,842 INFO L168 Benchmark]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 399.0 MB. Free memory was 345.2 MB in the beginning and 343.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:47:36,842 INFO L168 Benchmark]: RCFGBuilder took 190.64 ms. Allocated memory is still 399.0 MB. Free memory was 343.9 MB in the beginning and 323.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:36,842 INFO L168 Benchmark]: TraceAbstraction took 12694.78 ms. Allocated memory was 399.0 MB in the beginning and 746.1 MB in the end (delta: 347.1 MB). Free memory was 323.2 MB in the beginning and 452.9 MB in the end (delta: -129.7 MB). Peak memory consumption was 217.4 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:36,843 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.09 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.87 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.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 25.72 ms. Allocated memory is still 399.0 MB. Free memory was 345.2 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 190.64 ms. Allocated memory is still 399.0 MB. Free memory was 343.9 MB in the beginning and 323.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12694.78 ms. Allocated memory was 399.0 MB in the beginning and 746.1 MB in the end (delta: 347.1 MB). Free memory was 323.2 MB in the beginning and 452.9 MB in the end (delta: -129.7 MB). Peak memory consumption was 217.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 12.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 1480 SDslu, 2622 SDs, 0 SdLazy, 2609 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 124 SyntacticMatches, 7 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=14, 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 182 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 516 ConstructedInterpolants, 46 QuantifiedInterpolants, 170038 SizeOfPredicates, 41 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 10/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-47-36-850.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-47-36-850.csv Received shutdown request...