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-ccafca9-m [2018-02-03 22:48:02,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:48:02,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:48:02,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:48:02,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:48:02,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:48:02,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:48:02,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:48:02,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:48:02,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:48:02,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:48:02,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:48:02,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:48:02,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:48:02,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:48:02,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:48:02,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:48:02,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:48:02,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:48:02,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:48:02,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:48:02,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:48:02,855 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:48:02,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:48:02,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:48:02,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:48:02,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:48:02,859 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:48:02,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:48:02,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:48:02,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:48:02,860 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:48:02,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:48:02,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:48:02,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:48:02,874 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:48:02,874 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:48:02,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:48:02,874 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:48:02,875 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:48:02,876 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:48:02,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:48:02,876 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:48:02,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:48:02,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:48:02,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:48:02,877 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:48:02,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:48:02,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:48:02,877 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:48:02,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:48:02,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:48:02,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:48:02,919 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:48:02,922 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:48:02,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:48:02,924 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:48:02,924 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-03 22:48:03,080 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:48:03,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:48:03,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:48:03,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:48:03,086 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:48:03,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e54bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03, skipping insertion in model container [2018-02-03 22:48:03,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,102 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:48:03,128 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:48:03,215 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:48:03,226 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:48:03,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03 WrapperNode [2018-02-03 22:48:03,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:48:03,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:48:03,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:48:03,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:48:03,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... [2018-02-03 22:48:03,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:48:03,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:48:03,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:48:03,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:48:03,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:48:03,290 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:48:03,290 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:48:03,290 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-02-03 22:48:03,290 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:48:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:48:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:48:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:48:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:48:03,479 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:48:03,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:48:03 BoogieIcfgContainer [2018-02-03 22:48:03,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:48:03,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:48:03,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:48:03,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:48:03,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:48:03" (1/3) ... [2018-02-03 22:48:03,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:48:03, skipping insertion in model container [2018-02-03 22:48:03,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:48:03" (2/3) ... [2018-02-03 22:48:03,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5129bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:48:03, skipping insertion in model container [2018-02-03 22:48:03,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:48:03" (3/3) ... [2018-02-03 22:48:03,486 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:48:03,492 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:48:03,499 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:48:03,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:48:03,530 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:48:03,530 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:48:03,530 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:48:03,531 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:48:03,531 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:48:03,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:48:03,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:48:03,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:48:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-03 22:48:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:48:03,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:03,549 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:03,549 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-02-03 22:48:03,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:03,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:03,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:03,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:03,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:03,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:03,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:48:03,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:48:03,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:48:03,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:48:03,759 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-03 22:48:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:03,908 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-03 22:48:03,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:48:03,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:48:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:03,915 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:48:03,916 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:48:03,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:48:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:48:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:48:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:48:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-03 22:48:03,942 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-03 22:48:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:03,943 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-03 22:48:03,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:48:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-03 22:48:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:48:03,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:03,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:03,944 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-02-03 22:48:03,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:03,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:03,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:03,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:03,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:48:04,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:48:04,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:48:04,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:04,052 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-03 22:48:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,107 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-03 22:48:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:48:04,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:48:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,108 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:48:04,108 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:48:04,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:48:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:48:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 22:48:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:48:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-03 22:48:04,113 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-03 22:48:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,113 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-03 22:48:04,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:48:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-03 22:48:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:48:04,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,114 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-02-03 22:48:04,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:48:04,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:48:04,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:48:04,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:48:04,149 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-03 22:48:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,199 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-03 22:48:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:48:04,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:48:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,200 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:48:04,201 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:48:04,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:48:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:48:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:48:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:48:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-03 22:48:04,205 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-03 22:48:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,205 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-03 22:48:04,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:48:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-03 22:48:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:48:04,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,206 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,206 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,206 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-02-03 22:48:04,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:48:04,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:48:04,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:48:04,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:48:04,272 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-03 22:48:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,294 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-03 22:48:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:48:04,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:48:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,297 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:48:04,297 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:48:04,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:48:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:48:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:48:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-03 22:48:04,301 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-03 22:48:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,301 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-03 22:48:04,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:48:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-03 22:48:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:48:04,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,302 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,302 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-02-03 22:48:04,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:48:04,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:48:04,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:48:04,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:48:04,342 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-03 22:48:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,387 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-03 22:48:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:48:04,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-03 22:48:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,388 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:48:04,388 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:48:04,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:48:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:48:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:48:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-03 22:48:04,392 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-03 22:48:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,392 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-03 22:48:04,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:48:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-03 22:48:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-03 22:48:04,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,393 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,393 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-02-03 22:48:04,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:48:04,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:48:04,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:48:04,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:48:04,475 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-03 22:48:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,605 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-03 22:48:04,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:48:04,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-03 22:48:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,608 INFO L225 Difference]: With dead ends: 73 [2018-02-03 22:48:04,609 INFO L226 Difference]: Without dead ends: 73 [2018-02-03 22:48:04,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:48:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-03 22:48:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-03 22:48:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:48:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-03 22:48:04,613 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-03 22:48:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,613 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-03 22:48:04,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:48:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-03 22:48:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:48:04,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,614 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,614 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-02-03 22:48:04,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:48:04,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:48:04,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:48:04,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:04,651 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-03 22:48:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,714 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-03 22:48:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:48:04,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:48:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,716 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:48:04,716 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:48:04,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:48:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:48:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-03 22:48:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:48:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-03 22:48:04,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-03 22:48:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,719 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-03 22:48:04,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:48:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-03 22:48:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:48:04,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,720 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,720 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,720 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-02-03 22:48:04,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:04,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:48:04,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:48:04,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:48:04,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:48:04,796 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-03 22:48:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:04,883 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-03 22:48:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:48:04,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-03 22:48:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:04,884 INFO L225 Difference]: With dead ends: 67 [2018-02-03 22:48:04,884 INFO L226 Difference]: Without dead ends: 67 [2018-02-03 22:48:04,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:48:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-03 22:48:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-03 22:48:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 22:48:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-03 22:48:04,888 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-03 22:48:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:04,888 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-03 22:48:04,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:48:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-03 22:48:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:48:04,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:04,889 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:04,889 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-02-03 22:48:04,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:04,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:04,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:04,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:04,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:05,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:05,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:48:05,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:48:05,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:48:05,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:48:05,011 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states. [2018-02-03 22:48:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:05,119 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-02-03 22:48:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:48:05,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-03 22:48:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:05,120 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:48:05,120 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:48:05,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:48:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:48:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:48:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:48:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-03 22:48:05,123 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-03 22:48:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:05,123 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-03 22:48:05,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:48:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-03 22:48:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:48:05,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:05,124 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:05,124 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-02-03 22:48:05,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:05,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:05,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:05,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:05,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:05,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:05,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:48:05,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:48:05,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:48:05,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:48:05,147 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-02-03 22:48:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:05,151 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-03 22:48:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:48:05,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-03 22:48:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:05,152 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:48:05,152 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:48:05,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:48:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:48:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:48:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:48:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-03 22:48:05,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-03 22:48:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:05,156 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-03 22:48:05,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:48:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-03 22:48:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:48:05,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:05,157 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:05,157 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-02-03 22:48:05,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:05,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:05,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:05,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:05,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 22:48:05,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:05,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:48:05,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:48:05,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:48:05,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:48:05,293 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-02-03 22:48:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:05,407 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-02-03 22:48:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:48:05,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-03 22:48:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:05,408 INFO L225 Difference]: With dead ends: 62 [2018-02-03 22:48:05,408 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:48:05,408 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-03 22:48:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:48:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:48:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:48:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-03 22:48:05,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-02-03 22:48:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:05,410 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-03 22:48:05,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:48:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-03 22:48:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:48:05,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:05,410 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:05,411 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-02-03 22:48:05,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:05,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:05,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:05,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:05,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:05,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:05,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:48:05,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:48:05,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:48:05,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:48:05,519 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-02-03 22:48:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:05,650 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-03 22:48:05,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:48:05,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-03 22:48:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:05,650 INFO L225 Difference]: With dead ends: 77 [2018-02-03 22:48:05,650 INFO L226 Difference]: Without dead ends: 77 [2018-02-03 22:48:05,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:48:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-03 22:48:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-03 22:48:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 22:48:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-03 22:48:05,653 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-02-03 22:48:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:05,653 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-03 22:48:05,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:48:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-03 22:48:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:48:05,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:05,653 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:05,654 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-02-03 22:48:05,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:05,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:05,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:05,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:05,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:05,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:05,851 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:48:05,868 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:05,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:05,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:48:05,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:48:05,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:05,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:05,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:48:05,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:48:06,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-03 22:48:06,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:48:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:06,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:06,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:06,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-03 22:48:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:06,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:06,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-03 22:48:06,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 22:48:06,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 22:48:06,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-03 22:48:06,280 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-02-03 22:48:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:06,942 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-03 22:48:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:48:06,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-02-03 22:48:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:06,944 INFO L225 Difference]: With dead ends: 103 [2018-02-03 22:48:06,944 INFO L226 Difference]: Without dead ends: 103 [2018-02-03 22:48:06,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:48:06,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-03 22:48:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-02-03 22:48:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-03 22:48:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-03 22:48:06,949 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-02-03 22:48:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:06,949 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-03 22:48:06,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 22:48:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-03 22:48:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:48:06,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:06,952 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:06,952 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-02-03 22:48:06,952 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:06,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:06,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:06,953 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:06,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:06,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:07,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:07,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:48:07,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:48:07,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:48:07,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:48:07,029 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-02-03 22:48:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:07,142 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-03 22:48:07,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:48:07,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-03 22:48:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:07,142 INFO L225 Difference]: With dead ends: 82 [2018-02-03 22:48:07,142 INFO L226 Difference]: Without dead ends: 59 [2018-02-03 22:48:07,143 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-03 22:48:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-03 22:48:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-03 22:48:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 22:48:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-03 22:48:07,145 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-02-03 22:48:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:07,145 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-03 22:48:07,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:48:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-03 22:48:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:48:07,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:07,146 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-03 22:48:07,146 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-02-03 22:48:07,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:07,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:07,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:07,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:07,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:07,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:07,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:07,338 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:48:07,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:07,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:07,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:48:07,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:07,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:07,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:48:07,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:48:07,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:48:07,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:48:07,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:48:07,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:48:07,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-03 22:48:07,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:48:07,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:07,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:48:07,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:48:08,282 WARN L143 SmtUtils]: Spent 597ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-03 22:48:08,340 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-03 22:48:08,357 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-03 22:48:08,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-03 22:48:08,409 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-03 22:48:08,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,452 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-03 22:48:08,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,454 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-03 22:48:08,454 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,456 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-03 22:48:08,456 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,512 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-03 22:48:08,513 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-03 22:48:08,567 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-03 22:48:08,568 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,621 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-03 22:48:08,622 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:08,685 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-03 22:48:08,685 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:08,747 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-03 22:48:08,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,749 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-03 22:48:08,749 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:08,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-03 22:48:08,824 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-03 22:48:08,824 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-03 22:48:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:08,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:08,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-02-03 22:48:08,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-03 22:48:08,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-03 22:48:08,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-03 22:48:08,905 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 29 states. [2018-02-03 22:48:12,007 WARN L146 SmtUtils]: Spent 1421ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-02-03 22:48:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:12,705 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-02-03 22:48:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 22:48:12,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-02-03 22:48:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:12,707 INFO L225 Difference]: With dead ends: 124 [2018-02-03 22:48:12,707 INFO L226 Difference]: Without dead ends: 124 [2018-02-03 22:48:12,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=335, Invalid=1827, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:48:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-03 22:48:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-02-03 22:48:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-03 22:48:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-02-03 22:48:12,711 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2018-02-03 22:48:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:12,711 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-02-03 22:48:12,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-03 22:48:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-02-03 22:48:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 22:48:12,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:12,712 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:12,712 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-02-03 22:48:12,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:12,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:12,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:12,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:12,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:12,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:12,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:12,912 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:48:12,919 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:12,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:12,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:12,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:12,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:12,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:12,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:12,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:48:12,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:48:12,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 13 treesize of output 12 [2018-02-03 22:48:12,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:12,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:12,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:12,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-03 22:48:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:48: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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:48:13,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:13,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:48:13,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-02-03 22:48:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:13,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:13,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-03 22:48:13,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:48:13,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:48:13,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:48:13,227 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 24 states. [2018-02-03 22:48:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:13,863 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-02-03 22:48:13,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:48:13,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-02-03 22:48:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:13,863 INFO L225 Difference]: With dead ends: 108 [2018-02-03 22:48:13,863 INFO L226 Difference]: Without dead ends: 106 [2018-02-03 22:48:13,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 22:48:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-03 22:48:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2018-02-03 22:48:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:48:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-03 22:48:13,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 37 [2018-02-03 22:48:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:13,866 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-03 22:48:13,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:48:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-03 22:48:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 22:48:13,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:13,867 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-03 22:48:13,867 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1837728530, now seen corresponding path program 2 times [2018-02-03 22:48:13,867 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:13,867 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:13,867 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:13,868 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:13,868 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:13,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:14,189 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-03 22:48:14,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:14,190 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:48:14,197 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:14,217 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:14,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:14,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:14,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:14,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:14,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:48:14,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:14,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:14,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-03 22:48:14,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:48:14,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-03 22:48:14,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:48:14,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:48:14,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-03 22:48:14,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-03 22:48:14,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:48:14,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-03 22:48:14,769 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-03 22:48:14,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:48:14,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:14,780 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-03 22:48:14,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:14,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:14,797 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-03 22:48:14,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-03 22:48:14,946 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-03 22:48:14,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:14,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-03 22:48:14,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-03 22:48:14,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-03 22:48:14,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:48:14,964 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 33 states. [2018-02-03 22:48:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:18,259 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-03 22:48:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-03 22:48:18,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-02-03 22:48:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:18,260 INFO L225 Difference]: With dead ends: 122 [2018-02-03 22:48:18,260 INFO L226 Difference]: Without dead ends: 122 [2018-02-03 22:48:18,261 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-03 22:48:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-03 22:48:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 71. [2018-02-03 22:48:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-03 22:48:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-03 22:48:18,264 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 48 [2018-02-03 22:48:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:18,264 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-03 22:48:18,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-03 22:48:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-03 22:48:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-03 22:48:18,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:18,265 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-03 22:48:18,265 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:48:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash 899669712, now seen corresponding path program 1 times [2018-02-03 22:48:18,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:18,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:18,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:18,266 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:18,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:18,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:18,452 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-03 22:48:18,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:18,453 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:48:18,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:18,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:18,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:18,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:48:18,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:48:18,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:18,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:18,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:48:18,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:48:18,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:48:18,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:48:18,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:48:18,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:48:18,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:48:18,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-03 22:48:18,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:48:18,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,578 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-03 22:48:18,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-03 22:48:21,127 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-03 22:48:21,204 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-03 22:48:21,207 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-03 22:48:21,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,249 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-03 22:48:21,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:21,291 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-03 22:48:21,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-02-03 22:48:21,347 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-03 22:48:21,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,348 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-03 22:48:21,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,401 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-03 22:48:21,402 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:21,451 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-03 22:48:21,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,453 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-03 22:48:21,453 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,454 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-03 22:48:21,454 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,493 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-03 22:48:21,494 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,495 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-03 22:48:21,495 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:21,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-03 22:48:21,608 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-03 22:48:21,608 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:67, output treesize:78 [2018-02-03 22:48:21,723 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-03 22:48:21,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:21,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-02-03 22:48:21,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-03 22:48:21,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-03 22:48:21,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:48:21,741 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 33 states. [2018-02-03 22:48:27,002 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 52 DAG size of output 44 [2018-02-03 22:48:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:29,213 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-02-03 22:48:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-03 22:48:29,213 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-02-03 22:48:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:29,214 INFO L225 Difference]: With dead ends: 98 [2018-02-03 22:48:29,214 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:48:29,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2018-02-03 22:48:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:48:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:48:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:48:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:48:29,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-02-03 22:48:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:29,215 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:48:29,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-03 22:48:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:48:29,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:48:29,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:48:29 BoogieIcfgContainer [2018-02-03 22:48:29,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:48:29,219 INFO L168 Benchmark]: Toolchain (without parser) took 26138.01 ms. Allocated memory was 393.2 MB in the beginning and 789.6 MB in the end (delta: 396.4 MB). Free memory was 351.0 MB in the beginning and 408.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 338.5 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:29,219 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 393.2 MB. Free memory is still 356.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:48:29,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.16 ms. Allocated memory is still 393.2 MB. Free memory was 349.7 MB in the beginning and 339.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:29,219 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 393.2 MB. Free memory was 339.1 MB in the beginning and 337.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:29,220 INFO L168 Benchmark]: RCFGBuilder took 223.96 ms. Allocated memory is still 393.2 MB. Free memory was 337.7 MB in the beginning and 316.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:29,220 INFO L168 Benchmark]: TraceAbstraction took 25738.44 ms. Allocated memory was 393.2 MB in the beginning and 789.6 MB in the end (delta: 396.4 MB). Free memory was 316.5 MB in the beginning and 408.9 MB in the end (delta: -92.4 MB). Peak memory consumption was 304.0 MB. Max. memory is 5.3 GB. [2018-02-03 22:48:29,220 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 393.2 MB. Free memory is still 356.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.16 ms. Allocated memory is still 393.2 MB. Free memory was 349.7 MB in the beginning and 339.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 393.2 MB. Free memory was 339.1 MB in the beginning and 337.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.96 ms. Allocated memory is still 393.2 MB. Free memory was 337.7 MB in the beginning and 316.5 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 25738.44 ms. Allocated memory was 393.2 MB in the beginning and 789.6 MB in the end (delta: 396.4 MB). Free memory was 316.5 MB in the beginning and 408.9 MB in the end (delta: -92.4 MB). Peak memory consumption was 304.0 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, 25.6s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 667 SDtfs, 2003 SDslu, 2851 SDs, 0 SdLazy, 3873 SolverSat, 381 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 170 SyntacticMatches, 8 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2836 ImplicationChecksByTransitivity, 13.9s 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.9s 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-03_22-48-29-225.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-03_22-48-29-225.csv Received shutdown request...