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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:23:32,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:23:32,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:23:32,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:23:32,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:23:32,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:23:32,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:23:32,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:23:32,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:23:32,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:23:32,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:23:32,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:23:32,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:23:32,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:23:32,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:23:32,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:23:32,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:23:32,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:23:32,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:23:32,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:23:32,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:23:32,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:23:32,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:23:32,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:23:32,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:23:32,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:23:32,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:23:32,343 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:23:32,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:23:32,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:23:32,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:23:32,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:23:32,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:23:32,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:23:32,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:23:32,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:23:32,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:23:32,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:23:32,356 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:23:32,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:23:32,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:23:32,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:23:32,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:23:32,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:23:32,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:23:32,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:23:32,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:23:32,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:23:32,359 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:23:32,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:23:32,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:23:32,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:23:32,360 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:23:32,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:23:32,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:23:32,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:23:32,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:23:32,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:23:32,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:23:32,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:23:32,362 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:23:32,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:23:32,407 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:23:32,411 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:23:32,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:23:32,413 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:23:32,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-24 12:23:32,614 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:23:32,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:23:32,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:23:32,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:23:32,628 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:23:32,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d179ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32, skipping insertion in model container [2018-01-24 12:23:32,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,644 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:23:32,691 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:23:32,794 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:23:32,807 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:23:32,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32 WrapperNode [2018-01-24 12:23:32,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:23:32,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:23:32,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:23:32,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:23:32,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... [2018-01-24 12:23:32,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:23:32,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:23:32,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:23:32,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:23:32,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (1/1) ... No working directory specified, using /storage/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-01-24 12:23:32,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:23:32,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:23:32,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:23:32,898 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:23:32,898 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:23:32,899 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:23:32,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:23:32,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:23:33,034 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:23:33,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:23:33 BoogieIcfgContainer [2018-01-24 12:23:33,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:23:33,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:23:33,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:23:33,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:23:33,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:23:32" (1/3) ... [2018-01-24 12:23:33,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bbf2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:23:33, skipping insertion in model container [2018-01-24 12:23:33,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:23:32" (2/3) ... [2018-01-24 12:23:33,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bbf2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:23:33, skipping insertion in model container [2018-01-24 12:23:33,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:23:33" (3/3) ... [2018-01-24 12:23:33,040 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-24 12:23:33,047 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:23:33,052 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 12:23:33,100 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:23:33,100 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:23:33,100 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:23:33,101 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:23:33,101 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:23:33,101 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:23:33,101 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:23:33,101 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:23:33,102 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:23:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-24 12:23:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:23:33,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:33,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:33,130 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-01-24 12:23:33,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:33,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:33,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:33,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:33,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:33,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:33,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:23:33,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:23:33,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:23:33,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:23:33,330 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-01-24 12:23:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:33,503 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 12:23:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:23:33,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 12:23:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:33,517 INFO L225 Difference]: With dead ends: 53 [2018-01-24 12:23:33,517 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:23:33,521 INFO L525 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-01-24 12:23:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:23:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 12:23:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:23:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-01-24 12:23:33,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-01-24 12:23:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:33,554 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-01-24 12:23:33,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:23:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-01-24 12:23:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:23:33,556 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:33,556 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:33,556 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-01-24 12:23:33,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:33,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:33,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:33,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:33,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:33,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:33,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:23:33,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:23:33,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:23:33,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:23:33,650 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-01-24 12:23:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:33,745 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-01-24 12:23:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:23:33,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:23:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:33,747 INFO L225 Difference]: With dead ends: 52 [2018-01-24 12:23:33,747 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:23:33,748 INFO L525 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-01-24 12:23:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:23:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-01-24 12:23:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:23:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-01-24 12:23:33,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-01-24 12:23:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:33,758 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-01-24 12:23:33,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:23:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-01-24 12:23:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:23:33,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:33,759 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:33,759 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:33,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-01-24 12:23:33,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:33,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:33,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:33,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:33,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:33,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:23:33,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:23:33,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:23:33,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:23:33,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:23:33,836 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-01-24 12:23:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:33,873 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-01-24 12:23:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:23:33,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 12:23:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:33,875 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:23:33,875 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:23:33,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:23:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:23:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-01-24 12:23:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 12:23:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-01-24 12:23:33,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-01-24 12:23:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:33,886 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-01-24 12:23:33,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:23:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-01-24 12:23:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:23:33,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:33,887 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:33,887 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-01-24 12:23:33,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:33,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:33,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:33,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:33,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:23:33,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:33,966 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:33,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:34,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:34,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:23:34,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-24 12:23:34,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:23:34,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:23:34,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:34,089 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-01-24 12:23:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:34,102 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-01-24 12:23:34,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:34,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 12:23:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:34,103 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:23:34,103 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 12:23:34,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:23:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 12:23:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 12:23:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 12:23:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 12:23:34,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-01-24 12:23:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:34,110 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 12:23:34,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:23:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 12:23:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:23:34,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:34,112 INFO L322 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] [2018-01-24 12:23:34,112 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-01-24 12:23:34,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:34,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:34,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:34,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:34,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:34,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:34,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:34,202 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:34,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:34,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:34,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:23:34,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:34,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:23:34,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:23:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:34,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:34,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-24 12:23:34,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:23:34,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:23:34,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:23:34,317 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-24 12:23:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:34,480 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:23:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:23:34,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-24 12:23:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:34,482 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:23:34,482 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:23:34,482 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:23:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:23:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-24 12:23:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:23:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-24 12:23:34,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-01-24 12:23:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:34,489 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-24 12:23:34,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:23:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-24 12:23:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:23:34,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:34,490 INFO L322 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] [2018-01-24 12:23:34,490 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-01-24 12:23:34,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:34,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:34,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:34,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:34,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:34,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:34,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:34,785 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:34,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:34,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:34,848 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 20 treesize of output 19 [2018-01-24 12:23:34,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:34,865 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 17 treesize of output 16 [2018-01-24 12:23:34,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:34,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:23:34,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:23:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:35,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:35,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-24 12:23:35,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:23:35,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:23:35,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:23:35,116 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 14 states. [2018-01-24 12:23:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:35,438 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-01-24 12:23:35,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:23:35,438 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-01-24 12:23:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:35,439 INFO L225 Difference]: With dead ends: 39 [2018-01-24 12:23:35,439 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:23:35,440 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:23:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:23:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 12:23:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:23:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-01-24 12:23:35,445 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-01-24 12:23:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:35,445 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-01-24 12:23:35,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:23:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-01-24 12:23:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:23:35,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:35,446 INFO L322 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] [2018-01-24 12:23:35,446 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-01-24 12:23:35,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:35,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:35,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:35,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:35,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:35,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:35,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:35,583 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:35,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:35,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:35,614 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-01-24 12:23:35,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:35,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:23:35,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:23:35,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:35,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:35,640 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-01-24 12:23:35,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:35,645 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-01-24 12:23:35,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:23:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:35,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:35,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-24 12:23:35,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:23:35,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:23:35,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:23:35,684 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 11 states. [2018-01-24 12:23:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:35,840 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 12:23:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:23:35,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 12:23:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:35,841 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:23:35,841 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 12:23:35,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:23:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 12:23:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-01-24 12:23:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:23:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-01-24 12:23:35,848 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-01-24 12:23:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:35,849 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-01-24 12:23:35,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:23:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-01-24 12:23:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:23:35,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:35,850 INFO L322 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] [2018-01-24 12:23:35,850 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-01-24 12:23:35,850 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:35,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:35,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:35,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:35,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:35,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:36,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:36,193 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:36,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:36,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:36,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 12:23:36,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,277 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-01-24 12:23:36,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,279 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-01-24 12:23:36,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,299 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-01-24 12:23:36,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:23:36,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:23:36,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,568 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 54 treesize of output 67 [2018-01-24 12:23:36,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,618 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 46 treesize of output 40 [2018-01-24 12:23:36,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:23:36,667 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 45 treesize of output 39 [2018-01-24 12:23:36,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,704 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-01-24 12:23:36,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:36,737 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-01-24 12:23:36,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 12:23:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:36,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:36,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-24 12:23:36,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:23:36,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:23:36,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=331, Unknown=2, NotChecked=0, Total=380 [2018-01-24 12:23:36,869 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 20 states. [2018-01-24 12:23:37,340 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 12:23:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:58,195 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 12:23:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:23:58,195 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-01-24 12:23:58,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:58,196 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:23:58,196 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:23:58,197 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=116, Invalid=691, Unknown=5, NotChecked=0, Total=812 [2018-01-24 12:23:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:23:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-01-24 12:23:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:23:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-01-24 12:23:58,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-01-24 12:23:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:58,206 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-01-24 12:23:58,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:23:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-01-24 12:23:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:23:58,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:58,207 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 12:23:58,208 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-01-24 12:23:58,208 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:58,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:58,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:58,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:58,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:58,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:23:58,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:58,261 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:58,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:58,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:23:58,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:58,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-24 12:23:58,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:23:58,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:23:58,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:23:58,358 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-01-24 12:23:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:58,406 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-24 12:23:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:23:58,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 12:23:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:58,408 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:23:58,408 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 12:23:58,408 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-01-24 12:23:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 12:23:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 12:23:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:23:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-24 12:23:58,417 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-01-24 12:23:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:58,417 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-24 12:23:58,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:23:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-24 12:23:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:23:58,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:58,419 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:23:58,419 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-01-24 12:23:58,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:58,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:58,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:58,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:58,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:58,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:23:58,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:58,646 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:58,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:58,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:58,712 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 17 treesize of output 16 [2018-01-24 12:23:58,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:58,734 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 20 treesize of output 19 [2018-01-24 12:23:58,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:58,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:23:58,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:23:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:23:58,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:23:58,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-01-24 12:23:58,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:23:58,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:23:58,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:23:58,935 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-01-24 12:23:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:23:59,352 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-01-24 12:23:59,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:23:59,394 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-01-24 12:23:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:23:59,395 INFO L225 Difference]: With dead ends: 59 [2018-01-24 12:23:59,395 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:23:59,395 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:23:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:23:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-01-24 12:23:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:23:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 12:23:59,411 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-01-24 12:23:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:23:59,411 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 12:23:59,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:23:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 12:23:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:23:59,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:23:59,413 INFO L322 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] [2018-01-24 12:23:59,413 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:23:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-01-24 12:23:59,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:23:59,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:23:59,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:59,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:23:59,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:23:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:23:59,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:23:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:23:59,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:23:59,739 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:23:59,745 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:23:59,755 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:23:59,761 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:23:59,765 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:23:59,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:23:59,789 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-01-24 12:23:59,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:59,803 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-01-24 12:23:59,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:59,817 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-01-24 12:23:59,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:59,818 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-01-24 12:23:59,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:23:59,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:23:59,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:24:00,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,096 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-01-24 12:24:00,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:00,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,142 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 47 treesize of output 60 [2018-01-24 12:24:00,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:00,202 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-01-24 12:24:00,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:00,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:24:00,251 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 46 treesize of output 40 [2018-01-24 12:24:00,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:00,285 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-01-24 12:24:00,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 12:24:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:00,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:00,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-01-24 12:24:00,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 12:24:00,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 12:24:00,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=488, Unknown=6, NotChecked=0, Total=552 [2018-01-24 12:24:00,667 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 24 states. [2018-01-24 12:24:00,975 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 12:24:21,559 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 56 DAG size of output 51 [2018-01-24 12:24:24,352 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 57 DAG size of output 52 [2018-01-24 12:24:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:24,384 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-24 12:24:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:24:24,385 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-24 12:24:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:24,386 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:24:24,386 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:24:24,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=193, Invalid=1280, Unknown=9, NotChecked=0, Total=1482 [2018-01-24 12:24:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:24:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-01-24 12:24:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:24:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-01-24 12:24:24,400 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-01-24 12:24:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:24,400 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-01-24 12:24:24,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 12:24:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-01-24 12:24:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:24:24,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:24,402 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-24 12:24:24,402 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-01-24 12:24:24,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:24,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:24,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,404 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:24,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:24,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 12:24:24,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:24,456 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:24:24,468 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:24,480 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:24,485 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:24,487 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:24,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 12:24:24,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:24,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-24 12:24:24,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:24:24,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:24:24,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:24,531 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-01-24 12:24:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:24,563 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-01-24 12:24:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:24:24,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-24 12:24:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:24,564 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:24:24,564 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:24:24,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 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-01-24 12:24:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:24:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-01-24 12:24:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 12:24:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-01-24 12:24:24,574 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-01-24 12:24:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:24,575 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-01-24 12:24:24,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:24:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-01-24 12:24:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-24 12:24:24,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:24,576 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:24,576 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:24,576 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-01-24 12:24:24,577 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:24,577 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:24,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,578 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:24,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:24,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 12:24:24,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:24,672 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:24:24,681 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:24:24,696 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:24,701 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:24,708 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:24,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:24,718 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:24,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-24 12:24:24,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:24,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-24 12:24:24,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:24:24,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:24:24,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:24:24,802 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2018-01-24 12:24:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:24,896 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-01-24 12:24:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:24:24,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-01-24 12:24:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:24,898 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:24:24,898 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:24:24,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:24:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:24:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-01-24 12:24:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:24:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-01-24 12:24:24,918 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 51 [2018-01-24 12:24:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:24,918 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-01-24 12:24:24,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:24:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-01-24 12:24:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:24:24,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:24,920 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:24,920 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:24,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1516212575, now seen corresponding path program 4 times [2018-01-24 12:24:24,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:24,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:24,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,922 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:24,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:24,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-24 12:24:25,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:25,027 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:24:25,037 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:24:25,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:25,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-24 12:24:25,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:25,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-24 12:24:25,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:24:25,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:24:25,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:25,168 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 13 states. [2018-01-24 12:24:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:25,287 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-01-24 12:24:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:24:25,288 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-24 12:24:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:25,289 INFO L225 Difference]: With dead ends: 62 [2018-01-24 12:24:25,289 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:24:25,289 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:24:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-24 12:24:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:24:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 12:24:25,312 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2018-01-24 12:24:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:25,312 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 12:24:25,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:24:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 12:24:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 12:24:25,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:25,314 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:25,314 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash -342764997, now seen corresponding path program 5 times [2018-01-24 12:24:25,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:25,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:25,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:25,316 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:25,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:25,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-24 12:24:25,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:25,422 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:24:25,430 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:24:25,444 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,447 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,451 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,455 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,460 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,469 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:25,471 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:25,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-24 12:24:25,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:25,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-24 12:24:25,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:24:25,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:24:25,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:24:25,560 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 15 states. [2018-01-24 12:24:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:25,678 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-01-24 12:24:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:24:25,679 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 71 [2018-01-24 12:24:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:25,680 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:24:25,680 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 12:24:25,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:24:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 12:24:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-01-24 12:24:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-01-24 12:24:25,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 71 [2018-01-24 12:24:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:25,707 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-01-24 12:24:25,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:24:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-01-24 12:24:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-24 12:24:25,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:25,708 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:25,709 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:25,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1199419415, now seen corresponding path program 6 times [2018-01-24 12:24:25,709 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:25,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:25,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:25,710 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:25,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:25,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-24 12:24:25,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:25,839 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:25,847 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:24:25,866 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,872 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,878 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,885 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,902 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,931 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,942 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:25,944 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:25,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-01-24 12:24:26,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:26,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-24 12:24:26,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:24:26,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:24:26,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:24:26,124 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 17 states. [2018-01-24 12:24:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:26,247 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-01-24 12:24:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:24:26,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-01-24 12:24:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:26,248 INFO L225 Difference]: With dead ends: 74 [2018-01-24 12:24:26,249 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:24:26,249 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:24:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:24:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-01-24 12:24:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:24:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-01-24 12:24:26,277 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 81 [2018-01-24 12:24:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:26,278 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-01-24 12:24:26,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:24:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-01-24 12:24:26,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-24 12:24:26,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:26,279 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:26,279 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:26,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1552083699, now seen corresponding path program 7 times [2018-01-24 12:24:26,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:26,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:26,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:26,280 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:26,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:26,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-24 12:24:26,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:26,461 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:26,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:26,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-01-24 12:24:26,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:26,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 12:24:26,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:24:26,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:24:26,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:24:26,617 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 19 states. [2018-01-24 12:24:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:26,755 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-01-24 12:24:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:24:26,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-01-24 12:24:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:26,758 INFO L225 Difference]: With dead ends: 80 [2018-01-24 12:24:26,758 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:24:26,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:24:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:24:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-01-24 12:24:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:24:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-01-24 12:24:26,791 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 91 [2018-01-24 12:24:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:26,792 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-01-24 12:24:26,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:24:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-01-24 12:24:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-24 12:24:26,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:26,793 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:26,793 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1951482575, now seen corresponding path program 8 times [2018-01-24 12:24:26,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:26,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:26,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:26,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:26,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:26,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-24 12:24:26,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:26,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:26,991 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:27,012 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:27,039 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:27,045 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:27,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-01-24 12:24:27,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:27,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-24 12:24:27,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:24:27,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:24:27,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:24:27,228 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 21 states. [2018-01-24 12:24:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:27,367 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2018-01-24 12:24:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:24:27,368 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 101 [2018-01-24 12:24:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:27,368 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:24:27,369 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 12:24:27,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:24:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 12:24:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-01-24 12:24:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:24:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2018-01-24 12:24:27,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 101 [2018-01-24 12:24:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:27,392 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2018-01-24 12:24:27,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:24:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-01-24 12:24:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-24 12:24:27,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:27,394 INFO L322 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:27,394 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:27,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1340635051, now seen corresponding path program 9 times [2018-01-24 12:24:27,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:27,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:27,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:27,395 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:27,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:27,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-24 12:24:27,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:27,614 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:24:27,620 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:24:27,635 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,639 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,642 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,648 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,666 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,672 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,702 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:27,703 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:27,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-24 12:24:27,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:27,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-01-24 12:24:27,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:24:27,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:24:27,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:24:27,824 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 23 states. [2018-01-24 12:24:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:27,954 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-01-24 12:24:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:24:27,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2018-01-24 12:24:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:27,955 INFO L225 Difference]: With dead ends: 92 [2018-01-24 12:24:27,955 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 12:24:27,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:24:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 12:24:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-01-24 12:24:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:24:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-01-24 12:24:27,989 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 111 [2018-01-24 12:24:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:27,990 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-01-24 12:24:27,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:24:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-01-24 12:24:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-24 12:24:27,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:27,991 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:27,991 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 12:24:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1134053767, now seen corresponding path program 10 times [2018-01-24 12:24:27,992 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:27,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:27,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:27,993 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:27,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:24:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:24:28,069 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 12:24:28,101 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 12:24:28,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:24:28 BoogieIcfgContainer [2018-01-24 12:24:28,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:24:28,131 INFO L168 Benchmark]: Toolchain (without parser) took 55516.29 ms. Allocated memory was 298.3 MB in the beginning and 572.0 MB in the end (delta: 273.7 MB). Free memory was 257.4 MB in the beginning and 515.7 MB in the end (delta: -258.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:28,132 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 298.3 MB. Free memory is still 263.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:24:28,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.23 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 243.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:28,133 INFO L168 Benchmark]: Boogie Preprocessor took 35.53 ms. Allocated memory is still 298.3 MB. Free memory was 243.4 MB in the beginning and 241.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:28,133 INFO L168 Benchmark]: RCFGBuilder took 183.49 ms. Allocated memory is still 298.3 MB. Free memory was 241.5 MB in the beginning and 226.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:28,133 INFO L168 Benchmark]: TraceAbstraction took 55094.32 ms. Allocated memory was 298.3 MB in the beginning and 572.0 MB in the end (delta: 273.7 MB). Free memory was 226.8 MB in the beginning and 515.7 MB in the end (delta: -288.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:24:28,135 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 298.3 MB. Free memory is still 263.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.23 ms. Allocated memory is still 298.3 MB. Free memory was 257.4 MB in the beginning and 243.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.53 ms. Allocated memory is still 298.3 MB. Free memory was 243.4 MB in the beginning and 241.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.49 ms. Allocated memory is still 298.3 MB. Free memory was 241.5 MB in the beginning and 226.8 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55094.32 ms. Allocated memory was 298.3 MB in the beginning and 572.0 MB in the end (delta: 273.7 MB). Free memory was 226.8 MB in the beginning and 515.7 MB in the end (delta: -288.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1453] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={42:0}, i=0, len=10] [L1443] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1444] COND TRUE i