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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:03:53,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:03:53,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:03:53,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:03:53,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:03:53,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:03:53,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:03:53,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:03:53,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:03:53,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:03:53,981 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:03:53,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:03:53,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:03:53,983 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:03:53,984 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:03:53,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:03:53,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:03:53,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:03:53,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:03:53,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:03:53,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:03:53,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:03:53,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:03:53,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:03:53,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:03:53,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:03:53,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:03:53,995 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:03:53,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:03:53,995 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:03:53,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:03:53,996 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-04 12:03:54,005 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:03:54,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:03:54,007 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:03:54,007 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:03:54,007 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:03:54,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:03:54,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:03:54,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:03:54,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:03:54,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:03:54,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:03:54,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:03:54,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:03:54,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:54,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:03:54,010 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:03:54,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:03:54,010 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:03:54,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:03:54,046 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:03:54,051 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:03:54,052 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:03:54,053 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:03:54,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:54,195 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:03:54,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:03:54,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:54,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:03:54,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:03:54,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c76d208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54, skipping insertion in model container [2018-02-04 12:03:54,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,217 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:54,245 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:54,327 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:54,339 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:54,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54 WrapperNode [2018-02-04 12:03:54,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:54,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:03:54,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:03:54,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:03:54,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... [2018-02-04 12:03:54,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:03:54,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:03:54,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:03:54,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:03:54,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:54,406 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:03:54,406 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:03:54,406 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-04 12:03:54,406 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:03:54,406 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:03:54,406 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:03:54,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:03:54,557 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:03:54,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:54 BoogieIcfgContainer [2018-02-04 12:03:54,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:03:54,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:03:54,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:03:54,560 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:03:54,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:03:54" (1/3) ... [2018-02-04 12:03:54,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074f4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:54, skipping insertion in model container [2018-02-04 12:03:54,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:54" (2/3) ... [2018-02-04 12:03:54,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074f4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:54, skipping insertion in model container [2018-02-04 12:03:54,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:54" (3/3) ... [2018-02-04 12:03:54,562 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:54,567 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:03:54,572 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:03:54,599 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:03:54,599 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:03:54,599 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:03:54,600 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:03:54,600 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:03:54,600 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:03:54,600 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:03:54,600 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:03:54,601 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:03:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 12:03:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:03:54,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:54,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:54,623 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-04 12:03:54,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:54,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:54,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:54,657 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:54,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:54,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:54,791 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-04 12:03:54,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:54,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:54,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:54,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:54,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:54,802 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-04 12:03:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:54,941 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 12:03:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:54,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:03:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:54,950 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:03:54,950 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:03:54,951 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-04 12:03:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:03:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:03:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:03:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:03:54,974 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 12:03:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:54,974 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:03:54,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:03:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:03:54,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:54,975 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:54,975 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-04 12:03:54,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:54,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:54,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:54,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:54,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:54,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,069 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-04 12:03:55,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:55,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:03:55,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:03:55,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:55,071 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 12:03:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,139 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 12:03:55,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:55,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:03:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,140 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:03:55,140 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:03:55,141 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-04 12:03:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:03:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:03:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:03:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 12:03:55,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 12:03:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,145 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 12:03:55,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:03:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 12:03:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:55,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:55,146 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-04 12:03:55,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,176 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-04 12:03:55,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:55,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:55,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:55,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:55,177 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 12:03:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,232 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 12:03:55,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:55,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:03:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,233 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:03:55,234 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:03:55,234 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-04 12:03:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:03:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:03:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:03:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 12:03:55,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 12:03:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,238 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 12:03:55,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 12:03:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:03:55,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:55,240 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,240 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-04 12:03:55,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,300 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-04 12:03:55,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:55,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:55,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:55,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:55,302 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 12:03:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,333 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 12:03:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:55,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:03:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,334 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:03:55,334 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:03:55,334 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-04 12:03:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:03:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:03:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:03:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:03:55,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 12:03:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,338 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:03:55,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:03:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:03:55,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,339 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-04 12:03:55,339 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-04 12:03:55,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,340 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,375 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-04 12:03:55,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:55,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:55,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:55,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:55,376 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 12:03:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,421 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 12:03:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:55,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 12:03:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,422 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:03:55,422 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:03:55,422 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-04 12:03:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:03:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:03:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:03:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 12:03:55,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-04 12:03:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,427 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 12:03:55,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 12:03:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:03:55,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,428 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-04 12:03:55,428 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-04 12:03:55,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,507 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-04 12:03:55,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:03:55,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:03:55,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:03:55,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:55,508 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-04 12:03:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,587 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-04 12:03:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:03:55,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 12:03:55,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,590 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:03:55,590 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:03:55,590 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-04 12:03:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:03:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-04 12:03:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:03:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 12:03:55,592 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-04 12:03:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,592 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 12:03:55,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:03:55,593 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 12:03:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:03:55,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,593 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-04 12:03:55,593 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-04 12:03:55,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,594 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,627 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-04 12:03:55,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:55,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:03:55,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:03:55,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:55,628 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-04 12:03:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,686 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 12:03:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:55,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 12:03:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,687 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:03:55,687 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:03:55,688 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-04 12:03:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:03:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-04 12:03:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:03:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 12:03:55,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-04 12:03:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,691 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 12:03:55,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:03:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 12:03:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:03:55,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,692 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-04 12:03:55,692 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-04 12:03:55,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,768 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-04 12:03:55,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:03:55,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:03:55,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:03:55,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:03:55,769 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-04 12:03:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:55,860 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-04 12:03:55,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:03:55,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 12:03:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:55,861 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:03:55,861 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:03:55,861 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-04 12:03:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:03:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 12:03:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:03:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 12:03:55,864 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-04 12:03:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:55,865 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 12:03:55,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:03:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 12:03:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:03:55,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:55,866 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-04 12:03:55,866 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-04 12:03:55,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:55,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:55,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,867 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:55,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:55,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:55,966 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-04 12:03:55,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:55,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:03:55,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:03:55,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:03:55,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:03:55,967 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-02-04 12:03:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:56,067 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-04 12:03:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:03:56,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 12:03:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:56,068 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:03:56,068 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:03:56,068 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-04 12:03:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:03:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:03:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:03:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 12:03:56,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 12:03:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:56,071 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 12:03:56,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:03:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 12:03:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:03:56,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:56,072 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-04 12:03:56,072 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-04 12:03:56,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:56,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:56,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:56,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:56,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:56,094 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-04 12:03:56,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:56,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:56,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:03:56,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:03:56,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:56,095 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-04 12:03:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:56,103 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 12:03:56,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:03:56,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-04 12:03:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:56,104 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:03:56,104 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:03:56,104 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-04 12:03:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:03:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:03:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:03:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 12:03:56,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-04 12:03:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:56,108 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 12:03:56,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:03:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 12:03:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:03:56,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:56,108 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-04 12:03:56,109 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-04 12:03:56,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:56,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:56,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:56,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:56,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:56,274 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-04 12:03:56,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:56,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:03:56,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:03:56,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:03:56,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:03:56,276 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-04 12:03:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:56,408 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-04 12:03:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:03:56,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 12:03:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:56,409 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:03:56,409 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:03:56,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:03:56,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:03:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:03:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:03:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 12:03:56,411 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-04 12:03:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:56,412 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 12:03:56,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:03:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 12:03:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:03:56,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:56,412 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-04 12:03:56,412 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-04 12:03:56,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:56,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:56,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:56,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:56,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:56,503 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-04 12:03:56,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:56,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:03:56,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:03:56,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:03:56,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:03:56,504 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-04 12:03:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:56,649 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 12:03:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:03:56,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 12:03:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:56,655 INFO L225 Difference]: With dead ends: 77 [2018-02-04 12:03:56,655 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:03:56,655 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-04 12:03:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:03:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 12:03:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 12:03:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 12:03:56,657 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-04 12:03:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:56,657 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 12:03:56,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:03:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 12:03:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:03:56,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:56,658 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-04 12:03:56,658 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-04 12:03:56,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:56,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:56,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:56,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:56,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:56,788 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-04 12:03:56,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:56,788 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-04 12:03:56,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:56,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:56,879 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-04 12:03:56,880 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-04 12:03:56,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:56,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:56,889 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-04 12:03:56,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:03:56,994 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-04 12:03:57,002 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-04 12:03:57,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:57,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:57,019 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-04 12:03:57,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-04 12:03:57,097 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-04 12:03:57,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:57,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-04 12:03:57,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 12:03:57,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 12:03:57,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:03:57,115 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-02-04 12:03:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:57,711 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-04 12:03:57,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:03:57,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-02-04 12:03:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:57,719 INFO L225 Difference]: With dead ends: 103 [2018-02-04 12:03:57,719 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 12:03:57,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:03:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 12:03:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-04 12:03:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:03:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 12:03:57,725 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-04 12:03:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:57,725 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 12:03:57,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 12:03:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 12:03:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:03:57,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:57,726 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-04 12:03:57,727 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-04 12:03:57,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:57,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:57,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:57,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:57,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:57,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:57,806 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-04 12:03:57,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:57,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:03:57,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:03:57,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:03:57,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:03:57,807 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-02-04 12:03:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:57,979 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-04 12:03:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:03:57,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 12:03:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:57,980 INFO L225 Difference]: With dead ends: 82 [2018-02-04 12:03:57,980 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:03:57,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:03:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:03:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-04 12:03:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:03:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 12:03:57,982 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-02-04 12:03:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:57,983 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 12:03:57,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:03:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 12:03:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:03:57,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:57,984 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, 1, 1] [2018-02-04 12:03:57,984 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:03:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-02-04 12:03:57,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:57,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:57,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:57,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:57,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:57,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:58,160 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-04 12:03:58,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:58,160 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-04 12:03:58,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:58,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:58,181 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-04 12:03:58,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:03:58,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:58,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:58,206 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-04 12:03:58,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:03:58,234 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-04 12:03:58,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:03:58,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,240 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-04 12:03:58,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:03:58,260 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-04 12:03:58,261 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-04 12:03:58,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:58,269 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-04 12:03:58,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:03:59,091 WARN L143 SmtUtils]: Spent 569ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 12:03:59,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-02-04 12:03:59,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-02-04 12:03:59,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 12:03:59,210 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 41 treesize of output 33 [2018-02-04 12:03:59,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,251 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 35 treesize of output 27 [2018-02-04 12:03:59,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,258 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 34 treesize of output 26 [2018-02-04 12:03:59,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,260 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 31 treesize of output 23 [2018-02-04 12:03:59,261 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-02-04 12:03:59,313 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 12:03:59,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 26 [2018-02-04 12:03:59,379 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,436 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 37 treesize of output 35 [2018-02-04 12:03:59,436 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:59,503 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 26 treesize of output 24 [2018-02-04 12:03:59,503 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:59,569 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 31 treesize of output 23 [2018-02-04 12:03:59,570 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-02-04 12:03:59,572 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:59,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:03:59,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:03:59,657 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-04 12:03:59,723 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-04 12:03:59,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:59,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-02-04 12:03:59,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 12:03:59,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 12:03:59,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:03:59,741 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 29 states. [2018-02-04 12:04:03,723 WARN L146 SmtUtils]: Spent 1422ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-02-04 12:04:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:04,466 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-04 12:04:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:04:04,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-02-04 12:04:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:04,467 INFO L225 Difference]: With dead ends: 124 [2018-02-04 12:04:04,467 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 12:04:04,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=335, Invalid=1827, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:04:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 12:04:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-02-04 12:04:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 12:04:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-02-04 12:04:04,471 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2018-02-04 12:04:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:04,471 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-02-04 12:04:04,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 12:04:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-02-04 12:04:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:04:04,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:04,472 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-04 12:04:04,472 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:04:04,473 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-04 12:04:04,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:04,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:04,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:04,473 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:04,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:04,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:04,686 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-04 12:04:04,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:04,687 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-04 12:04:04,691 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:04:04,712 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:04:04,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:04:04,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:04,719 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-04 12:04:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:04,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:04,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:04:04,746 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-04 12:04:04,748 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-04 12:04:04,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:04,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:04,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:04,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 12:04:04,853 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-04 12:04:04,858 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-04 12:04:04,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:04,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:04,868 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-04 12:04:04,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-02-04 12:04:04,969 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-04 12:04:04,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:04,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-04 12:04:04,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 12:04:04,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 12:04:04,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-04 12:04:04,987 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 24 states. [2018-02-04 12:04:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:05,649 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-02-04 12:04:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:04:05,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-04 12:04:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:05,649 INFO L225 Difference]: With dead ends: 108 [2018-02-04 12:04:05,649 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 12:04:05,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:04:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 12:04:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2018-02-04 12:04:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:04:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 12:04:05,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 37 [2018-02-04 12:04:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:05,651 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 12:04:05,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 12:04:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 12:04:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:04:05,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:05,652 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 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-04 12:04:05,652 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:04:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1837728530, now seen corresponding path program 2 times [2018-02-04 12:04:05,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:05,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:05,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:05,653 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:04:05,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:05,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:05,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:05,933 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-04 12:04:05,937 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:04:05,953 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:04:05,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:04:05,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:05,964 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-04 12:04:05,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:05,970 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-04 12:04:05,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:05,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:05,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:04:06,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:06,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:06,010 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-04 12:04:06,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,019 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-04 12:04:06,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:04:06,065 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-04 12:04:06,067 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-04 12:04:06,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 12:04:06,101 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-04 12:04:06,102 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-04 12:04:06,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-04 12:04:06,561 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 46 treesize of output 40 [2018-02-04 12:04:06,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:04:06,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:06,574 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 21 treesize of output 13 [2018-02-04 12:04:06,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:06,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:06,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 2 xjuncts. [2018-02-04 12:04:06,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-04 12:04:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:06,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:06,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-04 12:04:06,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:06,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:06,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:06,794 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 33 states. [2018-02-04 12:04:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:10,071 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-04 12:04:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 12:04:10,071 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-04 12:04:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:10,072 INFO L225 Difference]: With dead ends: 122 [2018-02-04 12:04:10,072 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 12:04:10,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=832, Invalid=5174, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 12:04:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 12:04:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 71. [2018-02-04 12:04:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 12:04:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 12:04:10,074 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 48 [2018-02-04 12:04:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:10,074 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 12:04:10,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 12:04:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:04:10,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:10,075 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:10,075 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:04:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash 899669712, now seen corresponding path program 1 times [2018-02-04 12:04:10,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:10,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:10,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:10,076 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:04:10,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:10,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 12:04:10,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:10,235 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:04:10,240 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:10,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:10,263 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-04 12:04:10,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,266 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-04 12:04:10,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:04:10,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:10,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:10,296 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-04 12:04:10,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,301 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-04 12:04:10,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:04:10,328 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-04 12:04:10,329 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-04 12:04:10,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,334 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-04 12:04:10,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:04:10,352 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-04 12:04:10,354 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-04 12:04:10,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:10,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:10,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:04:12,865 WARN L143 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-04 12:04:12,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-02-04 12:04:12,933 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 49 treesize of output 39 [2018-02-04 12:04:12,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:12,977 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 41 treesize of output 39 [2018-02-04 12:04:12,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:13,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 49 [2018-02-04 12:04:13,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-04 12:04:13,074 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 35 treesize of output 27 [2018-02-04 12:04:13,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,076 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 29 treesize of output 21 [2018-02-04 12:04:13,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,132 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 35 treesize of output 33 [2018-02-04 12:04:13,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:13,190 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 40 treesize of output 30 [2018-02-04 12:04:13,190 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,191 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 35 treesize of output 25 [2018-02-04 12:04:13,192 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,193 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 41 treesize of output 31 [2018-02-04 12:04:13,193 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 22 [2018-02-04 12:04:13,261 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 23 treesize of output 16 [2018-02-04 12:04:13,262 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:13,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-04 12:04:13,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:04:13,399 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:67, output treesize:78 [2018-02-04 12:04:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 12:04:13,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:13,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-04 12:04:13,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:13,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:13,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:13,559 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 33 states. [2018-02-04 12:04:15,098 WARN L146 SmtUtils]: Spent 573ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-02-04 12:04:16,398 WARN L146 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 65 DAG size of output 57 [2018-02-04 12:04:16,863 WARN L146 SmtUtils]: Spent 429ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-02-04 12:04:17,328 WARN L146 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-02-04 12:04:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:17,506 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-02-04 12:04:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:04:17,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-02-04 12:04:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:17,507 INFO L225 Difference]: With dead ends: 98 [2018-02-04 12:04:17,507 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:04:17,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=893, Invalid=3397, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 12:04:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:04:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:04:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:04:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:04:17,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-02-04 12:04:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:17,508 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:04:17,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:04:17,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:04:17,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:04:17 BoogieIcfgContainer [2018-02-04 12:04:17,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:04:17,512 INFO L168 Benchmark]: Toolchain (without parser) took 23316.45 ms. Allocated memory was 396.4 MB in the beginning and 784.3 MB in the end (delta: 388.0 MB). Free memory was 353.2 MB in the beginning and 636.6 MB in the end (delta: -283.4 MB). Peak memory consumption was 104.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:17,513 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 396.4 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:04:17,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.91 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 342.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:17,513 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 ms. Allocated memory is still 396.4 MB. Free memory was 342.7 MB in the beginning and 340.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:17,513 INFO L168 Benchmark]: RCFGBuilder took 187.05 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 320.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:17,513 INFO L168 Benchmark]: TraceAbstraction took 22953.37 ms. Allocated memory was 396.4 MB in the beginning and 784.3 MB in the end (delta: 388.0 MB). Free memory was 320.7 MB in the beginning and 636.6 MB in the end (delta: -315.9 MB). Peak memory consumption was 72.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:04:17,514 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 396.4 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.91 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 342.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.33 ms. Allocated memory is still 396.4 MB. Free memory was 342.7 MB in the beginning and 340.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 187.05 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 320.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22953.37 ms. Allocated memory was 396.4 MB in the beginning and 784.3 MB in the end (delta: 388.0 MB). Free memory was 320.7 MB in the beginning and 636.6 MB in the end (delta: -315.9 MB). Peak memory consumption was 72.1 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, 22.9s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 667 SDtfs, 2005 SDslu, 2862 SDs, 0 SdLazy, 3882 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 168 SyntacticMatches, 8 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=15, 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, 18 MinimizatonAttempts, 199 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 696 ConstructedInterpolants, 126 QuantifiedInterpolants, 484411 SizeOfPredicates, 72 NumberOfNonLiveVariables, 883 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 97/220 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-04-17-521.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-04-17-521.csv Received shutdown request...