java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:29:33,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:29:33,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:29:33,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:29:33,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:29:33,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:29:33,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:29:33,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:29:33,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:29:33,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:29:33,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:29:33,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:29:33,312 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:29:33,313 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:29:33,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:29:33,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:29:33,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:29:33,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:29:33,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:29:33,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:29:33,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:29:33,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:29:33,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:29:33,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:29:33,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:29:33,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:29:33,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:29:33,325 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:29:33,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:29:33,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:29:33,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:29:33,326 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:29:33,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:29:33,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:29:33,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:29:33,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:29:33,337 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:29:33,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:29:33,338 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:29:33,339 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:29:33,339 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:29:33,339 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:29:33,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:29:33,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:29:33,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:29:33,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:29:33,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:29:33,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:29:33,340 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:29:33,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:29:33,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:29:33,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:29:33,380 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:29:33,384 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:29:33,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:29:33,385 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:29:33,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 09:29:33,532 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:29:33,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:29:33,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:29:33,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:29:33,541 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:29:33,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33, skipping insertion in model container [2018-02-02 09:29:33,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,561 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:29:33,601 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:29:33,682 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:29:33,694 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:29:33,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33 WrapperNode [2018-02-02 09:29:33,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:29:33,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:29:33,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:29:33,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:29:33,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... [2018-02-02 09:29:33,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:29:33,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:29:33,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:29:33,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:29:33,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:29:33,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:29:33,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:29:33,762 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:29:33,762 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:29:33,762 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:29:33,762 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:29:33,762 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:29:33,762 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:29:33,763 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:29:33,894 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:29:33,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:29:33 BoogieIcfgContainer [2018-02-02 09:29:33,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:29:33,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:29:33,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:29:33,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:29:33,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:29:33" (1/3) ... [2018-02-02 09:29:33,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecbfffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:29:33, skipping insertion in model container [2018-02-02 09:29:33,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:33" (2/3) ... [2018-02-02 09:29:33,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecbfffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:29:33, skipping insertion in model container [2018-02-02 09:29:33,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:29:33" (3/3) ... [2018-02-02 09:29:33,900 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 09:29:33,905 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:29:33,910 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 09:29:33,942 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:29:33,943 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:29:33,943 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:29:33,943 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:29:33,943 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:29:33,943 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:29:33,944 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:29:33,944 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:29:33,945 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:29:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 09:29:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:29:33,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:33,967 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:33,967 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-02 09:29:33,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:33,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:29:34,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:29:34,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:29:34,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:29:34,142 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 09:29:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,269 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 09:29:34,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:29:34,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 09:29:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,276 INFO L225 Difference]: With dead ends: 74 [2018-02-02 09:29:34,277 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 09:29:34,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:29:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 09:29:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-02 09:29:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 09:29:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-02 09:29:34,304 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-02 09:29:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,304 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-02 09:29:34,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:29:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-02 09:29:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:29:34,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,306 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:34,306 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-02 09:29:34,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:29:34,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:29:34,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:29:34,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:29:34,364 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-02 09:29:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,435 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-02 09:29:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:29:34,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:29:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,437 INFO L225 Difference]: With dead ends: 71 [2018-02-02 09:29:34,437 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:29:34,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:29:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:29:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-02 09:29:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:29:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 09:29:34,443 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-02 09:29:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,444 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 09:29:34,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:29:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 09:29:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:29:34,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:34,445 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-02 09:29:34,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:29:34,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:29:34,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:29:34,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,491 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-02 09:29:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,526 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-02 09:29:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:29:34,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:29:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,528 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:29:34,528 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 09:29:34,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 09:29:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-02 09:29:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:29:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-02 09:29:34,532 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-02 09:29:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,532 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-02 09:29:34,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:29:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-02 09:29:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:29:34,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,533 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:34,533 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-02 09:29:34,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:29:34,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:29:34,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:29:34,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,573 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-02 09:29:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,608 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-02 09:29:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:29:34,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:29:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,609 INFO L225 Difference]: With dead ends: 70 [2018-02-02 09:29:34,609 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 09:29:34,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 09:29:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-02 09:29:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:29:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-02 09:29:34,613 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-02 09:29:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,613 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-02 09:29:34,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:29:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-02 09:29:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:29:34,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,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] [2018-02-02 09:29:34,614 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-02 09:29:34,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:29:34,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:29:34,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:29:34,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,667 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-02 09:29:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,685 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-02 09:29:34,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:29:34,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:29:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,686 INFO L225 Difference]: With dead ends: 47 [2018-02-02 09:29:34,686 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:29:34,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:29:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 09:29:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 09:29:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 09:29:34,688 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-02 09:29:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,688 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 09:29:34,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:29:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 09:29:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:29:34,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,689 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] [2018-02-02 09:29:34,689 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-02 09:29:34,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,722 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:29:34,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:29:34,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:29:34,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:29:34,722 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-02 09:29:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,743 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 09:29:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:29:34,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 09:29:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,744 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:29:34,744 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:29:34,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:29:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:29:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 09:29:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:29:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 09:29:34,746 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-02 09:29:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,746 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 09:29:34,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:29:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 09:29:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:29:34,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,747 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] [2018-02-02 09:29:34,747 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-02 09:29:34,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:34,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:34,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:29:34,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:29:34,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:29:34,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:29:34,790 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 09:29:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:34,969 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 09:29:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:29:34,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 09:29:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:34,972 INFO L225 Difference]: With dead ends: 50 [2018-02-02 09:29:34,972 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:29:34,972 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:29:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:29:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-02 09:29:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:29:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 09:29:34,975 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 09:29:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:34,976 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 09:29:34,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:29:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 09:29:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:29:34,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:34,977 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] [2018-02-02 09:29:34,977 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-02 09:29:34,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:34,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:34,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:34,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:34,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:35,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:35,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:29:35,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:29:35,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:29:35,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:29:35,023 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-02 09:29:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:35,047 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-02 09:29:35,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:29:35,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 09:29:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:35,049 INFO L225 Difference]: With dead ends: 73 [2018-02-02 09:29:35,049 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:29:35,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:29:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:29:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-02 09:29:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:29:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-02 09:29:35,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-02 09:29:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:35,054 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-02 09:29:35,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:29:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-02 09:29:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:29:35,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:35,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:35,055 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-02 09:29:35,055 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:35,055 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:35,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:35,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:35,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:29:35,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:29:35,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:29:35,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:29:35,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:29:35,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:35,109 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-02 09:29:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:35,119 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 09:29:35,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:29:35,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 09:29:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:35,119 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:29:35,120 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:29:35,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:29:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:29:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-02 09:29:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:29:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-02 09:29:35,123 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-02 09:29:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:35,123 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-02 09:29:35,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:29:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-02 09:29:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:29:35,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:35,124 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:35,124 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-02 09:29:35,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:35,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:35,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:35,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:35,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:35,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:29:35,221 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:29:35,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:35,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:29:35,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:29:35,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:29:35,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:35,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:35,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-02 09:29:35,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:29:35,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 09:29:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:35,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:29:35,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-02 09:29:35,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:29:35,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:29:35,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:29:35,354 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 11 states. [2018-02-02 09:29:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:29:35,549 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-02 09:29:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:29:35,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-02 09:29:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:29:35,551 INFO L225 Difference]: With dead ends: 72 [2018-02-02 09:29:35,551 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 09:29:35,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:29:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 09:29:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-02-02 09:29:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:29:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-02 09:29:35,561 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-02 09:29:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:29:35,561 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-02 09:29:35,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:29:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-02 09:29:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:29:35,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:29:35,562 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:29:35,562 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:29:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-02 09:29:35,563 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:29:35,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:29:35,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:35,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:29:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:35,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:29:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:35,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:29:35,857 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:29:35,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:29:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:29:35,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:29:35,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 09:29:35,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,946 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 23 treesize of output 22 [2018-02-02 09:29:35,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,948 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 25 treesize of output 24 [2018-02-02 09:29:35,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,968 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 22 treesize of output 21 [2018-02-02 09:29:35,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:35,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:29:35,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 09:29:36,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:36,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:36,208 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 52 treesize of output 46 [2018-02-02 09:29:36,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:36,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:36,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:36,244 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 47 treesize of output 41 [2018-02-02 09:29:36,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:36,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:29:36,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-02 09:29:36,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:36,312 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 39 treesize of output 38 [2018-02-02 09:29:36,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:29:36,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 09:29:36,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-02 09:29:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:29:36,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:29:36,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-02 09:29:36,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:29:36,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:29:36,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-02-02 09:29:36,632 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 21 states. [2018-02-02 09:30:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:15,904 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-02-02 09:30:15,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:30:15,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-02 09:30:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:15,906 INFO L225 Difference]: With dead ends: 116 [2018-02-02 09:30:15,906 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 09:30:15,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=151, Invalid=901, Unknown=4, NotChecked=0, Total=1056 [2018-02-02 09:30:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 09:30:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2018-02-02 09:30:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 09:30:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-02 09:30:15,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-02 09:30:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:15,912 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-02 09:30:15,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:30:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-02 09:30:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:30:15,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:15,913 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:15,913 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-02 09:30:15,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:15,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:15,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:15,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:15,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:15,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:30:15,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:15,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:30:15,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:30:15,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:30:15,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:30:15,973 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-02 09:30:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:16,002 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-02 09:30:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:16,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 09:30:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:16,002 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:30:16,002 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:30:16,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:30:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:30:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 09:30:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:30:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-02 09:30:16,006 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-02 09:30:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:16,006 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-02 09:30:16,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:30:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-02 09:30:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:30:16,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:16,007 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:16,007 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-02 09:30:16,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:16,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:16,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:16,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:16,087 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:16,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:16,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:16,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-02 09:30:16,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:30:16,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:30:16,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-02 09:30:16,184 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-02-02 09:30:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:16,348 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-02 09:30:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:30:16,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 09:30:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:16,349 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:30:16,349 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 09:30:16,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-02 09:30:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 09:30:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 09:30:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:30:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-02 09:30:16,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-02 09:30:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:16,353 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-02 09:30:16,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:30:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-02 09:30:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:30:16,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:16,354 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:16,354 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-02 09:30:16,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:16,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:16,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:16,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:16,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:30:16,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:16,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:16,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:16,397 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-02 09:30:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:16,422 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-02 09:30:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:30:16,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 09:30:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:16,423 INFO L225 Difference]: With dead ends: 74 [2018-02-02 09:30:16,423 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 09:30:16,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:30:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 09:30:16,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-02 09:30:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 09:30:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 09:30:16,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-02 09:30:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:16,426 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 09:30:16,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 09:30:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 09:30:16,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:16,427 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-02 09:30:16,428 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-02 09:30:16,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:16,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:16,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:16,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:16,468 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:16,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:16,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:16,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-02 09:30:16,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:30:16,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:30:16,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:16,556 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 7 states. [2018-02-02 09:30:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:16,593 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-02 09:30:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:16,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-02-02 09:30:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:16,594 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:30:16,594 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:30:16,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:30:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-02 09:30:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:30:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-02 09:30:16,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-02 09:30:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:16,596 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-02 09:30:16,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:30:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-02 09:30:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 09:30:16,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:16,597 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:16,597 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-02 09:30:16,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:16,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:16,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:16,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:16,899 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:16,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:16,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:16,942 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 23 treesize of output 22 [2018-02-02 09:30:16,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:16,954 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 26 treesize of output 25 [2018-02-02 09:30:16,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:16,965 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 25 treesize of output 24 [2018-02-02 09:30:16,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:16,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 09:30:16,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:16,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:30:16,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 09:30:17,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-02-02 09:30:17,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:17,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:30:17,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:17,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:30:17,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-02-02 09:30:17,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:30:17,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:17,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:17,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-02-02 09:30:17,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:17,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:30:17,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-02-02 09:30:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:17,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:17,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-02 09:30:17,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:30:17,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:30:17,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=617, Unknown=1, NotChecked=0, Total=702 [2018-02-02 09:30:17,492 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 27 states. [2018-02-02 09:30:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:18,197 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-02 09:30:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:30:18,198 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-02-02 09:30:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:18,198 INFO L225 Difference]: With dead ends: 99 [2018-02-02 09:30:18,198 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 09:30:18,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1230, Unknown=4, NotChecked=0, Total=1406 [2018-02-02 09:30:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 09:30:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2018-02-02 09:30:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:30:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-02 09:30:18,200 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-02 09:30:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:18,201 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-02 09:30:18,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:30:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-02 09:30:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:30:18,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:18,201 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2018-02-02 09:30:18,201 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-02 09:30:18,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:18,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:18,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:18,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:18,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:30:18,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:30:18,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:30:18,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:18,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:18,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:18,253 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-02 09:30:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:18,321 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-02 09:30:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:30:18,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-02 09:30:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:18,322 INFO L225 Difference]: With dead ends: 64 [2018-02-02 09:30:18,322 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:30:18,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:18,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:30:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-02 09:30:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 09:30:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-02 09:30:18,324 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-02 09:30:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:18,324 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-02 09:30:18,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-02 09:30:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:30:18,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:18,325 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2018-02-02 09:30:18,325 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-02 09:30:18,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:18,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:18,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:18,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:18,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 09:30:18,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:18,484 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:18,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:18,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:18,524 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 15 treesize of output 12 [2018-02-02 09:30:18,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:30:18,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-02 09:30:18,647 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 23 treesize of output 19 [2018-02-02 09:30:18,649 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:18,649 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 09:30:18,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:18,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-02 09:30:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:18,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:18,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-02 09:30:18,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:30:18,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:30:18,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:30:18,688 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 21 states. [2018-02-02 09:30:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:18,890 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-02 09:30:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:30:18,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-02-02 09:30:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:18,891 INFO L225 Difference]: With dead ends: 92 [2018-02-02 09:30:18,891 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:30:18,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:30:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:30:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-02-02 09:30:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:30:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-02-02 09:30:18,893 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 43 [2018-02-02 09:30:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:18,893 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-02-02 09:30:18,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:30:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-02-02 09:30:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:30:18,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:18,894 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2018-02-02 09:30:18,894 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-02 09:30:18,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:18,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:18,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:18,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:18,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:19,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:19,050 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:19,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:19,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:19,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:30:19,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:30:19,097 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 15 treesize of output 12 [2018-02-02 09:30:19,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:30:19,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-02 09:30:19,127 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 13 treesize of output 1 [2018-02-02 09:30:19,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-02 09:30:19,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-02 09:30:19,168 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:19,168 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 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 09:30:19,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-02 09:30:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:19,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:19,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-02-02 09:30:19,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:30:19,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:30:19,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:30:19,203 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 23 states. [2018-02-02 09:30:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:19,442 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-02-02 09:30:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:30:19,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-02-02 09:30:19,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:19,443 INFO L225 Difference]: With dead ends: 84 [2018-02-02 09:30:19,443 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 09:30:19,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:30:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 09:30:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-02 09:30:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 09:30:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-02-02 09:30:19,445 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 43 [2018-02-02 09:30:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:19,445 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-02-02 09:30:19,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:30:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-02-02 09:30:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:30:19,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:19,445 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:19,445 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-02 09:30:19,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:19,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:19,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:19,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:19,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:19,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:30:19,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:19,483 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:19,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:19,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:30:19,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:30:19,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-02 09:30:19,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:30:19,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:30:19,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:30:19,545 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 6 states. [2018-02-02 09:30:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:19,569 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 09:30:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:30:19,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-02 09:30:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:19,569 INFO L225 Difference]: With dead ends: 82 [2018-02-02 09:30:19,569 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 09:30:19,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 09:30:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 09:30:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:30:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-02 09:30:19,571 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 45 [2018-02-02 09:30:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:19,571 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-02 09:30:19,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:30:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-02 09:30:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:30:19,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:19,572 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:19,572 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-02 09:30:19,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:19,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:19,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:19,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:19,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:19,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:30:19,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:19,796 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:19,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:19,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:30:19,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:30:19,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:19,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:19,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:30:19,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-02 09:30:19,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 09:30:19,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:30:19,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-02 09:30:19,966 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 5 treesize of output 1 [2018-02-02 09:30:19,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:19,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:30:19,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-02-02 09:30:21,992 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 21 [2018-02-02 09:30:22,077 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 36 treesize of output 30 [2018-02-02 09:30:22,078 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:22,079 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 30 treesize of output 20 [2018-02-02 09:30:22,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:22,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:22,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:22,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-02 09:30:22,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:30:22,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-02 09:30:22,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:22,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:30:22,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 09:30:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:30:22,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:22,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-02-02 09:30:22,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:30:22,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:30:22,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:30:22,150 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 34 states. [2018-02-02 09:30:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:23,334 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-02-02 09:30:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 09:30:23,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-02 09:30:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:23,335 INFO L225 Difference]: With dead ends: 119 [2018-02-02 09:30:23,335 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 09:30:23,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=572, Invalid=3588, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 09:30:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 09:30:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2018-02-02 09:30:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:30:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-02 09:30:23,337 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 48 [2018-02-02 09:30:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:23,337 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-02 09:30:23,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:30:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-02 09:30:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:30:23,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:23,338 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2018-02-02 09:30:23,338 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811558, now seen corresponding path program 1 times [2018-02-02 09:30:23,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:23,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:23,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:23,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:23,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:30:23,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:23,364 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:23,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:23,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 09:30:23,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:23,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-02 09:30:23,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:30:23,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:30:23,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:30:23,417 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 7 states. [2018-02-02 09:30:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:23,440 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-02-02 09:30:23,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:30:23,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-02 09:30:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:23,443 INFO L225 Difference]: With dead ends: 90 [2018-02-02 09:30:23,443 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 09:30:23,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:23,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 09:30:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-02-02 09:30:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 09:30:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-02-02 09:30:23,446 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 48 [2018-02-02 09:30:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:23,446 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-02-02 09:30:23,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:30:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-02-02 09:30:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 09:30:23,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:23,447 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02 09:30:23,447 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-02 09:30:23,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:23,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:23,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:23,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:23,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 09:30:23,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:23,491 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:23,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:23,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 09:30:23,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:23,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-02 09:30:23,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:30:23,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:30:23,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:23,560 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-02-02 09:30:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:30:23,585 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-02 09:30:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:30:23,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-02-02 09:30:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:30:23,585 INFO L225 Difference]: With dead ends: 124 [2018-02-02 09:30:23,586 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 09:30:23,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:30:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 09:30:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-02 09:30:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 09:30:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 09:30:23,587 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 49 [2018-02-02 09:30:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:30:23,588 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 09:30:23,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:30:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 09:30:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:30:23,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:30:23,588 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:30:23,588 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:30:23,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-02 09:30:23,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:30:23,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:30:23,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:23,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:30:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:23,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:30:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:30:24,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:30:24,382 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:30:24,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:30:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:30:24,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:30:24,654 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 49 treesize of output 46 [2018-02-02 09:30:24,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:30:24,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,675 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 49 treesize of output 46 [2018-02-02 09:30:24,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:30:24,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:30:24,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-02-02 09:30:24,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-02-02 09:30:24,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,912 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 53 treesize of output 35 [2018-02-02 09:30:24,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:24,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 09:30:24,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-02-02 09:30:25,825 WARN L146 SmtUtils]: Spent 850ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-02-02 09:30:30,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 75 treesize of output 67 [2018-02-02 09:30:30,192 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:30,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-02-02 09:30:30,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:30,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:30,242 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 75 treesize of output 67 [2018-02-02 09:30:30,263 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:30,263 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:30:30,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-02-02 09:30:30,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:30:30,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:30:30,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:30:30,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:151, output treesize:63 [2018-02-02 09:30:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:30:32,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:30:32,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-02 09:30:32,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:30:32,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:30:32,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1213, Unknown=23, NotChecked=0, Total=1332 [2018-02-02 09:30:32,541 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 37 states. [2018-02-02 09:30:40,005 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 163 DAG size of output 45 [2018-02-02 09:30:40,279 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 138 DAG size of output 87 [2018-02-02 09:30:40,510 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 128 DAG size of output 76 [2018-02-02 09:30:42,892 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 118 DAG size of output 75 Received shutdown request... [2018-02-02 09:30:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:30:46,997 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:30:46,999 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:30:46,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:30:46 BoogieIcfgContainer [2018-02-02 09:30:47,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:30:47,000 INFO L168 Benchmark]: Toolchain (without parser) took 73467.44 ms. Allocated memory was 394.8 MB in the beginning and 764.9 MB in the end (delta: 370.1 MB). Free memory was 351.5 MB in the beginning and 717.5 MB in the end (delta: -366.0 MB). Peak memory consumption was 346.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:30:47,001 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:30:47,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.51 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 338.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:30:47,001 INFO L168 Benchmark]: Boogie Preprocessor took 27.31 ms. Allocated memory is still 394.8 MB. Free memory was 338.3 MB in the beginning and 336.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:30:47,001 INFO L168 Benchmark]: RCFGBuilder took 166.46 ms. Allocated memory is still 394.8 MB. Free memory was 336.9 MB in the beginning and 318.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:30:47,001 INFO L168 Benchmark]: TraceAbstraction took 73104.35 ms. Allocated memory was 394.8 MB in the beginning and 764.9 MB in the end (delta: 370.1 MB). Free memory was 317.1 MB in the beginning and 717.5 MB in the end (delta: -400.4 MB). Peak memory consumption was 312.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:30:47,002 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.16 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.51 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 338.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.31 ms. Allocated memory is still 394.8 MB. Free memory was 338.3 MB in the beginning and 336.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 166.46 ms. Allocated memory is still 394.8 MB. Free memory was 336.9 MB in the beginning and 318.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73104.35 ms. Allocated memory was 394.8 MB in the beginning and 764.9 MB in the end (delta: 370.1 MB). Free memory was 317.1 MB in the beginning and 717.5 MB in the end (delta: -400.4 MB). Peak memory consumption was 312.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 73.0s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 57.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 973 SDtfs, 1469 SDslu, 4458 SDs, 0 SdLazy, 4231 SolverSat, 330 SolverUnsat, 60 SolverUnknown, 0 SolverNotchecked, 44.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 798 GetRequests, 450 SyntacticMatches, 14 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 353 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1275 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1239 ConstructedInterpolants, 102 QuantifiedInterpolants, 479572 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1780 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 36 InterpolantComputations, 13 PerfectInterpolantSequences, 256/429 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-30-47-006.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-30-47-006.csv Completed graceful shutdown