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_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:45:59,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:45:59,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:45:59,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:45:59,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:45:59,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:45:59,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:45:59,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:45:59,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:45:59,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:45:59,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:45:59,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:45:59,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:45:59,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:45:59,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:45:59,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:45:59,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:45:59,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:45:59,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:45:59,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:45:59,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:45:59,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:45:59,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:45:59,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:45:59,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:45:59,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:45:59,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:45:59,141 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:45:59,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:45:59,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:45:59,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:45:59,142 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_SS.epf [2018-01-29 22:45:59,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:45:59,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:45:59,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:45:59,154 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:45:59,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:45:59,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:45:59,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:45:59,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:45:59,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:45:59,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:45:59,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:45:59,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:45:59,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:45:59,156 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:45:59,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:45:59,157 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:45:59,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:45:59,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:45:59,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:45:59,158 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:45:59,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:45:59,158 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:45:59,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:45:59,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:45:59,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:45:59,159 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:45:59,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:45:59,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:45:59,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:45:59,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:45:59,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:45:59,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:45:59,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:45:59,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:45:59,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:45:59,210 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:45:59,214 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:45:59,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:45:59,216 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:45:59,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:45:59,386 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:45:59,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:45:59,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:45:59,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:45:59,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:45:59,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59, skipping insertion in model container [2018-01-29 22:45:59,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,424 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:45:59,465 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:45:59,584 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:45:59,601 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:45:59,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59 WrapperNode [2018-01-29 22:45:59,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:45:59,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:45:59,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:45:59,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:45:59,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (1/1) ... [2018-01-29 22:45:59,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:45:59,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:45:59,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:45:59,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:45:59,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (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-29 22:45:59,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:45:59,702 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:45:59,702 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-29 22:45:59,702 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:45:59,702 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-29 22:45:59,703 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:45:59,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:45:59,704 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:45:59,931 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:45:59,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:45:59 BoogieIcfgContainer [2018-01-29 22:45:59,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:45:59,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:45:59,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:45:59,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:45:59,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:45:59" (1/3) ... [2018-01-29 22:45:59,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:45:59, skipping insertion in model container [2018-01-29 22:45:59,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:59" (2/3) ... [2018-01-29 22:45:59,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:45:59, skipping insertion in model container [2018-01-29 22:45:59,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:45:59" (3/3) ... [2018-01-29 22:45:59,937 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:45:59,943 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:45:59,949 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-29 22:45:59,993 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:45:59,993 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:45:59,993 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:45:59,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:45:59,993 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:45:59,993 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:45:59,993 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:45:59,993 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:45:59,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:46:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-29 22:46:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:46:00,018 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:00,019 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:00,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2106869167, now seen corresponding path program 1 times [2018-01-29 22:46:00,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:00,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:00,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:00,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:00,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:00,294 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-29 22:46:00,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:00,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:46:00,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:46:00,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:46:00,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:46:00,311 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 4 states. [2018-01-29 22:46:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:00,484 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-01-29 22:46:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:46:00,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:46:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:00,494 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:46:00,494 INFO L226 Difference]: Without dead ends: 68 [2018-01-29 22:46:00,497 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:46:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-29 22:46:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-29 22:46:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 22:46:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-29 22:46:00,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 19 [2018-01-29 22:46:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:00,532 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-29 22:46:00,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:46:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-29 22:46:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:46:00,533 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:00,533 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:00,533 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2106869168, now seen corresponding path program 1 times [2018-01-29 22:46:00,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:00,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:00,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:00,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:00,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:00,704 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-29 22:46:00,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:00,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:46:00,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:46:00,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:46:00,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:00,730 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2018-01-29 22:46:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:00,826 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-01-29 22:46:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:46:00,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 22:46:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:00,829 INFO L225 Difference]: With dead ends: 68 [2018-01-29 22:46:00,829 INFO L226 Difference]: Without dead ends: 67 [2018-01-29 22:46:00,830 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-29 22:46:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-29 22:46:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 22:46:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-01-29 22:46:00,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 19 [2018-01-29 22:46:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:00,839 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-01-29 22:46:00,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:46:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-01-29 22:46:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:46:00,840 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:00,840 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:00,841 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash 888434797, now seen corresponding path program 1 times [2018-01-29 22:46:00,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:00,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:00,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:00,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:00,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:00,893 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-29 22:46:00,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:00,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:46:00,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:46:00,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:46:00,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:46:00,895 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2018-01-29 22:46:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:00,954 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-01-29 22:46:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:46:00,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:46:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:00,955 INFO L225 Difference]: With dead ends: 67 [2018-01-29 22:46:00,956 INFO L226 Difference]: Without dead ends: 66 [2018-01-29 22:46:00,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:46:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-29 22:46:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-29 22:46:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-29 22:46:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-29 22:46:00,964 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 20 [2018-01-29 22:46:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:00,964 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-29 22:46:00,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:46:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-29 22:46:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:46:00,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:00,966 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:00,966 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash 888434798, now seen corresponding path program 1 times [2018-01-29 22:46:00,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:00,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:00,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:00,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:00,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:01,051 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-29 22:46:01,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:01,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:46:01,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:46:01,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:46:01,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:46:01,052 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-01-29 22:46:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:01,082 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-29 22:46:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:46:01,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:46:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:01,084 INFO L225 Difference]: With dead ends: 66 [2018-01-29 22:46:01,084 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 22:46:01,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 22:46:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-29 22:46:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 22:46:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-29 22:46:01,089 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 20 [2018-01-29 22:46:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:01,090 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-29 22:46:01,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:46:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-29 22:46:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:46:01,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:01,091 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:01,091 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1011206392, now seen corresponding path program 1 times [2018-01-29 22:46:01,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:01,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:01,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:01,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:01,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:01,203 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-29 22:46:01,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:01,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:46:01,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:01,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:01,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:01,205 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-01-29 22:46:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:01,314 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-29 22:46:01,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:46:01,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-29 22:46:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:01,315 INFO L225 Difference]: With dead ends: 65 [2018-01-29 22:46:01,315 INFO L226 Difference]: Without dead ends: 64 [2018-01-29 22:46:01,315 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-29 22:46:01,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-29 22:46:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 22:46:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-29 22:46:01,322 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 33 [2018-01-29 22:46:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:01,323 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-29 22:46:01,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-29 22:46:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:46:01,324 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:01,325 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:01,325 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1011206391, now seen corresponding path program 1 times [2018-01-29 22:46:01,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:01,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:01,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:01,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:01,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:01,511 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-29 22:46:01,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:01,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:46:01,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:46:01,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:46:01,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:01,513 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 10 states. [2018-01-29 22:46:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:01,724 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-29 22:46:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:46:01,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-29 22:46:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:01,725 INFO L225 Difference]: With dead ends: 72 [2018-01-29 22:46:01,726 INFO L226 Difference]: Without dead ends: 71 [2018-01-29 22:46:01,726 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:46:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-29 22:46:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-01-29 22:46:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-29 22:46:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-01-29 22:46:01,734 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 33 [2018-01-29 22:46:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:01,734 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-01-29 22:46:01,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:46:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-01-29 22:46:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:46:01,735 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:01,736 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:01,736 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1089686732, now seen corresponding path program 1 times [2018-01-29 22:46:01,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:01,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:01,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:01,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:01,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:01,820 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-29 22:46:01,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:01,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:46:01,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:01,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:01,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:01,822 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 7 states. [2018-01-29 22:46:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:01,974 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-29 22:46:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:46:01,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-29 22:46:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:01,976 INFO L225 Difference]: With dead ends: 73 [2018-01-29 22:46:01,976 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 22:46:01,976 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 22:46:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-01-29 22:46:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 22:46:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-29 22:46:01,984 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 41 [2018-01-29 22:46:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:01,984 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-29 22:46:01,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-29 22:46:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:46:01,986 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:01,986 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:01,986 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1089686733, now seen corresponding path program 1 times [2018-01-29 22:46:01,986 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:01,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:01,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:01,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:01,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:02,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:02,202 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-29 22:46:02,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:02,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:46:02,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:46:02,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:46:02,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:02,203 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 10 states. [2018-01-29 22:46:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:02,322 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-29 22:46:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:46:02,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-01-29 22:46:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:02,323 INFO L225 Difference]: With dead ends: 77 [2018-01-29 22:46:02,324 INFO L226 Difference]: Without dead ends: 76 [2018-01-29 22:46:02,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:46:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-29 22:46:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-01-29 22:46:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:46:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-29 22:46:02,332 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 41 [2018-01-29 22:46:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:02,333 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-29 22:46:02,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:46:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-29 22:46:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:46:02,335 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:02,335 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:02,335 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1967564283, now seen corresponding path program 1 times [2018-01-29 22:46:02,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:02,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:02,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:02,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:02,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:02,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:02,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:02,692 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-29 22:46:02,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:02,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:02,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:46:02,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:46:02,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:02,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:02,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:02,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:46:03,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 22:46:03,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:46:03,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:03,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:03,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:03,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:46:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:03,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:03,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-01-29 22:46:03,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 22:46:03,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 22:46:03,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:46:03,264 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 23 states. [2018-01-29 22:46:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:04,429 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-01-29 22:46:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:46:04,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-01-29 22:46:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:04,432 INFO L225 Difference]: With dead ends: 101 [2018-01-29 22:46:04,433 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 22:46:04,434 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:46:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 22:46:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2018-01-29 22:46:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 22:46:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-01-29 22:46:04,442 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 50 [2018-01-29 22:46:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:04,442 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-01-29 22:46:04,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 22:46:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-01-29 22:46:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 22:46:04,443 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:04,443 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:04,443 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -939263310, now seen corresponding path program 1 times [2018-01-29 22:46:04,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:04,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:04,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:04,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:04,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:04,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:04,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:04,898 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-29 22:46:04,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:04,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:04,931 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-29 22:46:04,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:04,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:04,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:46:04,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:04,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:04,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:46:04,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:04,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:04,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:46:05,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:46:05,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:46:05,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:05,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:05,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:05,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:46:05,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:46:05,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:46:05,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:05,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:05,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:05,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:46:05,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-29 22:46:05,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-29 22:46:05,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:05,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:46:05,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:05,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:05,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:05,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-29 22:46:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:05,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:05,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-01-29 22:46:05,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 22:46:05,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 22:46:05,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:46:05,578 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 32 states. [2018-01-29 22:46:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,073 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-01-29 22:46:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:46:08,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2018-01-29 22:46:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,074 INFO L225 Difference]: With dead ends: 121 [2018-01-29 22:46:08,074 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 22:46:08,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=331, Invalid=2320, Unknown=1, NotChecked=0, Total=2652 [2018-01-29 22:46:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 22:46:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-29 22:46:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 22:46:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-29 22:46:08,089 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 51 [2018-01-29 22:46:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,089 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-29 22:46:08,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 22:46:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-29 22:46:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 22:46:08,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,091 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:08,091 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -971938378, now seen corresponding path program 1 times [2018-01-29 22:46:08,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:08,320 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-29 22:46:08,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:08,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:46:08,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:46:08,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:46:08,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:08,321 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 6 states. [2018-01-29 22:46:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,509 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-01-29 22:46:08,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:46:08,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-01-29 22:46:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,511 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:46:08,511 INFO L226 Difference]: Without dead ends: 99 [2018-01-29 22:46:08,512 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:46:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-29 22:46:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-29 22:46:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:46:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-29 22:46:08,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 55 [2018-01-29 22:46:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,526 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-29 22:46:08,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:46:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-29 22:46:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 22:46:08,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,528 INFO L350 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:08,528 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash 176335821, now seen corresponding path program 2 times [2018-01-29 22:46:08,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:09,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:09,041 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-29 22:46:09,046 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:09,061 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:09,066 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:09,068 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:09,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:09,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:46:09,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:09,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:09,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:46:09,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:46:09,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:46:09,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:09,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:09,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:09,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-29 22:46:09,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 22:46:09,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-29 22:46:09,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:09,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:09,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:09,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:46:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:09,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:09,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-29 22:46:09,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 22:46:09,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 22:46:09,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-01-29 22:46:09,597 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 30 states. [2018-01-29 22:46:10,571 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 79 DAG size of output 60 [2018-01-29 22:46:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:11,235 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-01-29 22:46:11,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 22:46:11,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2018-01-29 22:46:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:11,236 INFO L225 Difference]: With dead ends: 120 [2018-01-29 22:46:11,236 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 22:46:11,237 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=348, Invalid=2004, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:46:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 22:46:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 72. [2018-01-29 22:46:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:46:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-29 22:46:11,246 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 59 [2018-01-29 22:46:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:11,246 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-29 22:46:11,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 22:46:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-29 22:46:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:46:11,247 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:11,247 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:11,247 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 972916251, now seen corresponding path program 2 times [2018-01-29 22:46:11,247 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:11,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:11,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:11,248 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:11,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:11,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:11,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:11,832 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-29 22:46:11,846 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:11,858 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:11,866 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:11,868 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:11,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:11,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:46:11,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,888 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-29 22:46:11,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:46:11,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:11,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:11,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:46:11,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:46:11,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:46:12,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:46:12,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:46:12,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:12,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:12,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:12,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:46:12,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-29 22:46:12,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:46:12,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:12,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:12,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:12,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-29 22:46:12,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-29 22:46:12,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-29 22:46:12,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:12,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-29 22:46:12,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:12,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:12,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:12,613 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-29 22:46:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:12,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:12,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-01-29 22:46:12,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 22:46:12,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 22:46:12,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 22:46:12,787 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 37 states. [2018-01-29 22:46:14,588 WARN L146 SmtUtils]: Spent 1341ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-29 22:46:15,645 WARN L146 SmtUtils]: Spent 876ms on a formula simplification. DAG size of input: 93 DAG size of output 59 [2018-01-29 22:46:18,711 WARN L146 SmtUtils]: Spent 932ms on a formula simplification. DAG size of input: 88 DAG size of output 65 [2018-01-29 22:46:18,909 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 104 DAG size of output 73 [2018-01-29 22:46:21,777 WARN L146 SmtUtils]: Spent 2490ms on a formula simplification. DAG size of input: 92 DAG size of output 62 [2018-01-29 22:46:22,003 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 98 DAG size of output 68 [2018-01-29 22:46:22,220 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 102 DAG size of output 73 [2018-01-29 22:46:22,376 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 83 DAG size of output 62 [2018-01-29 22:46:23,681 WARN L146 SmtUtils]: Spent 617ms on a formula simplification. DAG size of input: 73 DAG size of output 53 [2018-01-29 22:46:23,997 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 90 DAG size of output 65 [2018-01-29 22:46:24,255 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 77 DAG size of output 57 [2018-01-29 22:46:24,613 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 91 DAG size of output 69 [2018-01-29 22:46:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:24,620 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-01-29 22:46:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 22:46:24,621 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 69 [2018-01-29 22:46:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:24,621 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:46:24,621 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:46:24,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=441, Invalid=3218, Unknown=1, NotChecked=0, Total=3660 [2018-01-29 22:46:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:46:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:46:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:46:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:46:24,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-01-29 22:46:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:24,623 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:46:24,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 22:46:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:46:24,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:46:24,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:46:24,815 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 202 DAG size of output 201 [2018-01-29 22:46:25,068 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 94 DAG size of output 67 [2018-01-29 22:48:29,205 WARN L146 SmtUtils]: Spent 124132ms on a formula simplification. DAG size of input: 233 DAG size of output 159 Received shutdown request... [2018-01-29 22:48:39,963 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-29 22:48:39,964 INFO L168 Benchmark]: Toolchain (without parser) took 160577.17 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 266.2 MB in the beginning and 323.3 MB in the end (delta: -57.1 MB). Peak memory consumption was 250.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:48:39,965 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:48:39,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.51 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:48:39,965 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:48:39,965 INFO L168 Benchmark]: RCFGBuilder took 284.84 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 233.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:48:39,965 INFO L168 Benchmark]: TraceAbstraction took 160031.06 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 233.5 MB in the beginning and 323.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 217.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:48:39,967 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.21 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.51 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.84 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 233.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 160031.06 ms. Allocated memory was 306.2 MB in the beginning and 589.3 MB in the end (delta: 283.1 MB). Free memory was 233.5 MB in the beginning and 323.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 217.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 216. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-48-39-974.csv Completed graceful shutdown