java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label48_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:14:35,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:14:35,305 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:14:35,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:14:35,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:14:35,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:14:35,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:14:35,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:14:35,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:14:35,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:14:35,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:14:35,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:14:35,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:14:35,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:14:35,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:14:35,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:14:35,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:14:35,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:14:35,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:14:35,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:14:35,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:14:35,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:14:35,340 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:14:35,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:14:35,341 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:14:35,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:14:35,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:14:35,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:14:35,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:14:35,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:14:35,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:14:35,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:14:35,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:14:35,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:14:35,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:14:35,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:14:35,349 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:14:35,364 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:14:35,364 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:14:35,365 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:14:35,365 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:14:35,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:14:35,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:14:35,366 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:14:35,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:14:35,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:14:35,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:14:35,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:14:35,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:14:35,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:14:35,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:14:35,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:14:35,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:14:35,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:14:35,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:14:35,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:14:35,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:14:35,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:14:35,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:14:35,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:14:35,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:14:35,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:14:35,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:14:35,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:14:35,370 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:14:35,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:14:35,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:14:35,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:14:35,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:14:35,433 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:14:35,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label48_false-unreach-call.c [2018-11-06 19:14:35,491 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f773d0c49/da9c066165ab4fbaae71c551912404ba/FLAG1f4ea636a [2018-11-06 19:14:36,349 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:14:36,350 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label48_false-unreach-call.c [2018-11-06 19:14:36,388 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f773d0c49/da9c066165ab4fbaae71c551912404ba/FLAG1f4ea636a [2018-11-06 19:14:36,410 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f773d0c49/da9c066165ab4fbaae71c551912404ba [2018-11-06 19:14:36,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:14:36,424 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:14:36,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:14:36,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:14:36,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:14:36,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:14:36" (1/1) ... [2018-11-06 19:14:36,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193d11b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:36, skipping insertion in model container [2018-11-06 19:14:36,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:14:36" (1/1) ... [2018-11-06 19:14:36,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:14:36,617 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:14:38,309 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:14:38,314 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:14:39,148 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:14:39,190 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:14:39,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39 WrapperNode [2018-11-06 19:14:39,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:14:39,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:14:39,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:14:39,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:14:39,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:39,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:14:40,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:14:40,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:14:40,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:14:40,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... [2018-11-06 19:14:40,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:14:40,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:14:40,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:14:40,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:14:40,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (1/1) ... No working directory specified, using /storage/repos/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-11-06 19:14:40,539 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:14:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:14:40,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:14:53,036 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:14:53,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:14:53 BoogieIcfgContainer [2018-11-06 19:14:53,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:14:53,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:14:53,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:14:53,041 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:14:53,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:14:36" (1/3) ... [2018-11-06 19:14:53,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4ea906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:14:53, skipping insertion in model container [2018-11-06 19:14:53,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:14:39" (2/3) ... [2018-11-06 19:14:53,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4ea906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:14:53, skipping insertion in model container [2018-11-06 19:14:53,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:14:53" (3/3) ... [2018-11-06 19:14:53,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label48_false-unreach-call.c [2018-11-06 19:14:53,055 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:14:53,066 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:14:53,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:14:53,132 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:14:53,133 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:14:53,133 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:14:53,133 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:14:53,133 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:14:53,134 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:14:53,134 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:14:53,134 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:14:53,134 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:14:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 19:14:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-06 19:14:53,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:14:53,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:14:53,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:14:53,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:14:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984234, now seen corresponding path program 1 times [2018-11-06 19:14:53,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:14:53,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:14:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:53,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:14:53,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:14:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:14:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:14:53,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:14:53,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:14:53,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:14:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:14:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:14:53,456 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 3 states. [2018-11-06 19:15:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:02,779 INFO L93 Difference]: Finished difference Result 3150 states and 5809 transitions. [2018-11-06 19:15:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:15:02,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-06 19:15:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:02,818 INFO L225 Difference]: With dead ends: 3150 [2018-11-06 19:15:02,818 INFO L226 Difference]: Without dead ends: 2047 [2018-11-06 19:15:02,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:15:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-11-06 19:15:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2034. [2018-11-06 19:15:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2018-11-06 19:15:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 3389 transitions. [2018-11-06 19:15:02,976 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 3389 transitions. Word has length 7 [2018-11-06 19:15:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:02,978 INFO L480 AbstractCegarLoop]: Abstraction has 2034 states and 3389 transitions. [2018-11-06 19:15:02,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:15:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 3389 transitions. [2018-11-06 19:15:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-06 19:15:02,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:02,983 INFO L375 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, 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-11-06 19:15:02,983 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:02,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2142238128, now seen corresponding path program 1 times [2018-11-06 19:15:02,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:02,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:02,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:02,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:02,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:03,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:03,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:03,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:03,332 INFO L87 Difference]: Start difference. First operand 2034 states and 3389 transitions. Second operand 4 states. [2018-11-06 19:15:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:16,318 INFO L93 Difference]: Finished difference Result 7335 states and 12450 transitions. [2018-11-06 19:15:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:16,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-06 19:15:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:16,347 INFO L225 Difference]: With dead ends: 7335 [2018-11-06 19:15:16,347 INFO L226 Difference]: Without dead ends: 5303 [2018-11-06 19:15:16,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2018-11-06 19:15:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 3660. [2018-11-06 19:15:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3660 states. [2018-11-06 19:15:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5616 transitions. [2018-11-06 19:15:16,437 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 5616 transitions. Word has length 79 [2018-11-06 19:15:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:16,438 INFO L480 AbstractCegarLoop]: Abstraction has 3660 states and 5616 transitions. [2018-11-06 19:15:16,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 5616 transitions. [2018-11-06 19:15:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-06 19:15:16,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:16,442 INFO L375 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, 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-11-06 19:15:16,442 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:16,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1129398637, now seen corresponding path program 1 times [2018-11-06 19:15:16,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:16,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:16,696 INFO L87 Difference]: Start difference. First operand 3660 states and 5616 transitions. Second operand 4 states. [2018-11-06 19:15:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:28,940 INFO L93 Difference]: Finished difference Result 13875 states and 21556 transitions. [2018-11-06 19:15:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:28,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-06 19:15:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:28,991 INFO L225 Difference]: With dead ends: 13875 [2018-11-06 19:15:28,992 INFO L226 Difference]: Without dead ends: 10217 [2018-11-06 19:15:28,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2018-11-06 19:15:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 6857. [2018-11-06 19:15:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6857 states. [2018-11-06 19:15:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 10077 transitions. [2018-11-06 19:15:29,140 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 10077 transitions. Word has length 93 [2018-11-06 19:15:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 6857 states and 10077 transitions. [2018-11-06 19:15:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 10077 transitions. [2018-11-06 19:15:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-06 19:15:29,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:29,144 INFO L375 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, 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, 1, 1, 1, 1, 1, 1] [2018-11-06 19:15:29,144 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:29,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash -498687584, now seen corresponding path program 1 times [2018-11-06 19:15:29,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:29,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:29,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:29,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:29,451 INFO L87 Difference]: Start difference. First operand 6857 states and 10077 transitions. Second operand 4 states. [2018-11-06 19:15:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:41,229 INFO L93 Difference]: Finished difference Result 24212 states and 35533 transitions. [2018-11-06 19:15:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:41,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-06 19:15:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:41,290 INFO L225 Difference]: With dead ends: 24212 [2018-11-06 19:15:41,291 INFO L226 Difference]: Without dead ends: 17357 [2018-11-06 19:15:41,302 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17357 states. [2018-11-06 19:15:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17357 to 13186. [2018-11-06 19:15:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13186 states. [2018-11-06 19:15:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13186 states to 13186 states and 19180 transitions. [2018-11-06 19:15:41,559 INFO L78 Accepts]: Start accepts. Automaton has 13186 states and 19180 transitions. Word has length 111 [2018-11-06 19:15:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:41,559 INFO L480 AbstractCegarLoop]: Abstraction has 13186 states and 19180 transitions. [2018-11-06 19:15:41,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 13186 states and 19180 transitions. [2018-11-06 19:15:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-06 19:15:41,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:41,562 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:15:41,562 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:41,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1799340876, now seen corresponding path program 1 times [2018-11-06 19:15:41,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:41,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:41,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:41,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:41,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:41,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:41,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:41,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:41,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:41,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:41,766 INFO L87 Difference]: Start difference. First operand 13186 states and 19180 transitions. Second operand 4 states. [2018-11-06 19:15:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:15:50,052 INFO L93 Difference]: Finished difference Result 39235 states and 55192 transitions. [2018-11-06 19:15:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:15:50,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-11-06 19:15:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:15:50,120 INFO L225 Difference]: With dead ends: 39235 [2018-11-06 19:15:50,121 INFO L226 Difference]: Without dead ends: 26051 [2018-11-06 19:15:50,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26051 states. [2018-11-06 19:15:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26051 to 26023. [2018-11-06 19:15:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26023 states. [2018-11-06 19:15:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26023 states to 26023 states and 35099 transitions. [2018-11-06 19:15:50,526 INFO L78 Accepts]: Start accepts. Automaton has 26023 states and 35099 transitions. Word has length 119 [2018-11-06 19:15:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:15:50,527 INFO L480 AbstractCegarLoop]: Abstraction has 26023 states and 35099 transitions. [2018-11-06 19:15:50,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:15:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26023 states and 35099 transitions. [2018-11-06 19:15:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-06 19:15:50,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:15:50,531 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:15:50,531 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:15:50,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:15:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1584730266, now seen corresponding path program 1 times [2018-11-06 19:15:50,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:15:50,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:15:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:15:50,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:15:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:15:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:15:50,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:15:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:15:50,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:15:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:15:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:15:50,855 INFO L87 Difference]: Start difference. First operand 26023 states and 35099 transitions. Second operand 4 states. [2018-11-06 19:16:00,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:00,025 INFO L93 Difference]: Finished difference Result 82885 states and 113451 transitions. [2018-11-06 19:16:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:00,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-06 19:16:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:00,136 INFO L225 Difference]: With dead ends: 82885 [2018-11-06 19:16:00,136 INFO L226 Difference]: Without dead ends: 56864 [2018-11-06 19:16:00,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56864 states. [2018-11-06 19:16:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56864 to 41001. [2018-11-06 19:16:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41001 states. [2018-11-06 19:16:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41001 states to 41001 states and 53553 transitions. [2018-11-06 19:16:00,745 INFO L78 Accepts]: Start accepts. Automaton has 41001 states and 53553 transitions. Word has length 122 [2018-11-06 19:16:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:00,746 INFO L480 AbstractCegarLoop]: Abstraction has 41001 states and 53553 transitions. [2018-11-06 19:16:00,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41001 states and 53553 transitions. [2018-11-06 19:16:00,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-06 19:16:00,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:00,748 INFO L375 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, 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, 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-11-06 19:16:00,748 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:00,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -3204673, now seen corresponding path program 1 times [2018-11-06 19:16:00,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:00,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:00,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:16:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:16:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:01,062 INFO L87 Difference]: Start difference. First operand 41001 states and 53553 transitions. Second operand 4 states. [2018-11-06 19:16:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:12,059 INFO L93 Difference]: Finished difference Result 137151 states and 180114 transitions. [2018-11-06 19:16:12,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:12,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-11-06 19:16:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:12,185 INFO L225 Difference]: With dead ends: 137151 [2018-11-06 19:16:12,185 INFO L226 Difference]: Without dead ends: 96152 [2018-11-06 19:16:12,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96152 states. [2018-11-06 19:16:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96152 to 92988. [2018-11-06 19:16:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92988 states. [2018-11-06 19:16:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92988 states to 92988 states and 112583 transitions. [2018-11-06 19:16:13,435 INFO L78 Accepts]: Start accepts. Automaton has 92988 states and 112583 transitions. Word has length 130 [2018-11-06 19:16:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:13,436 INFO L480 AbstractCegarLoop]: Abstraction has 92988 states and 112583 transitions. [2018-11-06 19:16:13,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 92988 states and 112583 transitions. [2018-11-06 19:16:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-06 19:16:13,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:13,439 INFO L375 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, 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, 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-11-06 19:16:13,439 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:13,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:13,440 INFO L82 PathProgramCache]: Analyzing trace with hash -73147650, now seen corresponding path program 1 times [2018-11-06 19:16:13,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:13,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:13,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:13,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:16:13,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:13,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:16:13,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:13,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:13,665 INFO L87 Difference]: Start difference. First operand 92988 states and 112583 transitions. Second operand 4 states. [2018-11-06 19:16:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:28,339 INFO L93 Difference]: Finished difference Result 228915 states and 275127 transitions. [2018-11-06 19:16:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:28,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-11-06 19:16:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:28,530 INFO L225 Difference]: With dead ends: 228915 [2018-11-06 19:16:28,530 INFO L226 Difference]: Without dead ends: 135929 [2018-11-06 19:16:28,602 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135929 states. [2018-11-06 19:16:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135929 to 132498. [2018-11-06 19:16:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132498 states. [2018-11-06 19:16:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132498 states to 132498 states and 158119 transitions. [2018-11-06 19:16:30,101 INFO L78 Accepts]: Start accepts. Automaton has 132498 states and 158119 transitions. Word has length 133 [2018-11-06 19:16:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:30,102 INFO L480 AbstractCegarLoop]: Abstraction has 132498 states and 158119 transitions. [2018-11-06 19:16:30,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 132498 states and 158119 transitions. [2018-11-06 19:16:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-06 19:16:30,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:30,104 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:16:30,104 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:30,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 132926939, now seen corresponding path program 1 times [2018-11-06 19:16:30,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:30,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:30,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:30,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:30,372 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:16:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 19:16:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:16:30,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:16:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:16:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:30,422 INFO L87 Difference]: Start difference. First operand 132498 states and 158119 transitions. Second operand 4 states. [2018-11-06 19:16:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:41,198 INFO L93 Difference]: Finished difference Result 406123 states and 483268 transitions. [2018-11-06 19:16:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:16:41,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-06 19:16:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:41,521 INFO L225 Difference]: With dead ends: 406123 [2018-11-06 19:16:41,522 INFO L226 Difference]: Without dead ends: 273627 [2018-11-06 19:16:41,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:16:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273627 states. [2018-11-06 19:16:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273627 to 273540. [2018-11-06 19:16:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273540 states. [2018-11-06 19:16:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273540 states to 273540 states and 310924 transitions. [2018-11-06 19:16:45,515 INFO L78 Accepts]: Start accepts. Automaton has 273540 states and 310924 transitions. Word has length 153 [2018-11-06 19:16:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:16:45,516 INFO L480 AbstractCegarLoop]: Abstraction has 273540 states and 310924 transitions. [2018-11-06 19:16:45,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:16:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 273540 states and 310924 transitions. [2018-11-06 19:16:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-06 19:16:45,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:16:45,520 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:16:45,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:16:45,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:16:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash 177060465, now seen corresponding path program 1 times [2018-11-06 19:16:45,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:16:45,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:16:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:45,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:16:45,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:16:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:16:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:16:45,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:16:45,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:16:45,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:16:45,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:16:45,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:16:45,701 INFO L87 Difference]: Start difference. First operand 273540 states and 310924 transitions. Second operand 3 states. [2018-11-06 19:16:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:16:53,558 INFO L93 Difference]: Finished difference Result 516083 states and 584192 transitions. [2018-11-06 19:16:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:16:53,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2018-11-06 19:16:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:16:53,865 INFO L225 Difference]: With dead ends: 516083 [2018-11-06 19:16:53,865 INFO L226 Difference]: Without dead ends: 243333 [2018-11-06 19:16:54,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:16:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243333 states. [2018-11-06 19:16:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243333 to 221218. [2018-11-06 19:16:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221218 states. [2018-11-06 19:17:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221218 states to 221218 states and 242358 transitions. [2018-11-06 19:17:06,817 INFO L78 Accepts]: Start accepts. Automaton has 221218 states and 242358 transitions. Word has length 223 [2018-11-06 19:17:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:06,818 INFO L480 AbstractCegarLoop]: Abstraction has 221218 states and 242358 transitions. [2018-11-06 19:17:06,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:17:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 221218 states and 242358 transitions. [2018-11-06 19:17:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-06 19:17:06,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:06,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-06 19:17:06,828 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:06,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1830265456, now seen corresponding path program 1 times [2018-11-06 19:17:06,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:06,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:06,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-06 19:17:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:17:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:17:07,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:17:07,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:17:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:07,189 INFO L87 Difference]: Start difference. First operand 221218 states and 242358 transitions. Second operand 5 states. [2018-11-06 19:17:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:17:19,833 INFO L93 Difference]: Finished difference Result 456646 states and 499579 transitions. [2018-11-06 19:17:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:17:19,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2018-11-06 19:17:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:17:20,157 INFO L225 Difference]: With dead ends: 456646 [2018-11-06 19:17:20,157 INFO L226 Difference]: Without dead ends: 229111 [2018-11-06 19:17:20,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229111 states. [2018-11-06 19:17:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229111 to 219616. [2018-11-06 19:17:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219616 states. [2018-11-06 19:17:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219616 states to 219616 states and 240439 transitions. [2018-11-06 19:17:23,990 INFO L78 Accepts]: Start accepts. Automaton has 219616 states and 240439 transitions. Word has length 270 [2018-11-06 19:17:23,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:23,990 INFO L480 AbstractCegarLoop]: Abstraction has 219616 states and 240439 transitions. [2018-11-06 19:17:23,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:17:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 219616 states and 240439 transitions. [2018-11-06 19:17:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-06 19:17:23,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:23,996 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:17:23,996 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:23,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1868165603, now seen corresponding path program 1 times [2018-11-06 19:17:23,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-06 19:17:24,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:17:24,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:17:24,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:17:24,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:17:24,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:24,272 INFO L87 Difference]: Start difference. First operand 219616 states and 240439 transitions. Second operand 5 states. [2018-11-06 19:17:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:17:42,206 INFO L93 Difference]: Finished difference Result 553870 states and 607677 transitions. [2018-11-06 19:17:42,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:17:42,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 307 [2018-11-06 19:17:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:17:42,623 INFO L225 Difference]: With dead ends: 553870 [2018-11-06 19:17:42,623 INFO L226 Difference]: Without dead ends: 335044 [2018-11-06 19:17:42,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335044 states. [2018-11-06 19:17:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335044 to 316645. [2018-11-06 19:17:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316645 states. [2018-11-06 19:17:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316645 states to 316645 states and 345522 transitions. [2018-11-06 19:17:47,517 INFO L78 Accepts]: Start accepts. Automaton has 316645 states and 345522 transitions. Word has length 307 [2018-11-06 19:17:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:17:47,517 INFO L480 AbstractCegarLoop]: Abstraction has 316645 states and 345522 transitions. [2018-11-06 19:17:47,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:17:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 316645 states and 345522 transitions. [2018-11-06 19:17:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-11-06 19:17:47,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:17:47,526 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:17:47,527 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:17:47,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:17:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1534296657, now seen corresponding path program 1 times [2018-11-06 19:17:47,527 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:17:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:17:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:17:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 352 proven. 9 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-06 19:17:48,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:17:48,112 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-06 19:17:48,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:17:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:17:48,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:17:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-06 19:17:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:17:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 19:17:48,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:17:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:17:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:17:48,622 INFO L87 Difference]: Start difference. First operand 316645 states and 345522 transitions. Second operand 5 states. [2018-11-06 19:18:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:18:07,892 INFO L93 Difference]: Finished difference Result 760977 states and 830719 transitions. [2018-11-06 19:18:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:18:07,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 367 [2018-11-06 19:18:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:18:08,497 INFO L225 Difference]: With dead ends: 760977 [2018-11-06 19:18:08,498 INFO L226 Difference]: Without dead ends: 435645 [2018-11-06 19:18:08,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 367 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:18:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435645 states. Received shutdown request... [2018-11-06 19:18:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435645 to 400911. [2018-11-06 19:18:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400911 states. [2018-11-06 19:18:20,509 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:18:20,514 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:18:20,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:18:20 BoogieIcfgContainer [2018-11-06 19:18:20,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:18:20,515 INFO L168 Benchmark]: Toolchain (without parser) took 224092.16 ms. Allocated memory was 1.5 GB in the beginning and 5.5 GB in the end (delta: 4.0 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,516 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:18:20,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2766.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 808.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,518 INFO L168 Benchmark]: Boogie Preprocessor took 458.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,519 INFO L168 Benchmark]: RCFGBuilder took 12577.05 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 243.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 575.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,520 INFO L168 Benchmark]: TraceAbstraction took 207476.28 ms. Allocated memory was 2.6 GB in the beginning and 5.5 GB in the end (delta: 2.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:18:20,526 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2766.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 808.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 812.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 458.83 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12577.05 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 243.3 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 575.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207476.28 ms. Allocated memory was 2.6 GB in the beginning and 5.5 GB in the end (delta: 2.9 GB). Free memory was 2.1 GB in the beginning and 3.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 30). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 207.3s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 161.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11720 SDtfs, 27841 SDslu, 3956 SDs, 0 SdLazy, 69262 SolverSat, 14263 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 120.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 380 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316645occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 41.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 81769 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2481 NumberOfCodeBlocks, 2481 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2467 ConstructedInterpolants, 0 QuantifiedInterpolants, 1496333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1784/1793 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown