./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_security_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/psyco/psyco_security_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cc1f38a976dda42d71f86348e088e61d77f90eb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 05:48:12,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 05:48:12,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 05:48:12,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 05:48:12,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 05:48:12,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 05:48:12,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 05:48:12,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 05:48:12,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 05:48:12,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 05:48:12,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 05:48:12,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 05:48:12,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 05:48:12,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 05:48:12,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 05:48:12,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 05:48:12,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 05:48:12,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 05:48:12,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 05:48:12,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 05:48:12,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 05:48:12,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 05:48:12,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 05:48:12,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 05:48:12,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 05:48:12,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 05:48:12,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 05:48:12,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 05:48:12,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 05:48:12,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 05:48:12,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 05:48:12,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 05:48:12,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 05:48:12,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 05:48:12,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 05:48:12,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 05:48:12,609 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 05:48:12,623 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 05:48:12,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 05:48:12,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 05:48:12,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 05:48:12,625 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 05:48:12,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 05:48:12,625 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 05:48:12,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 05:48:12,627 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 05:48:12,627 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 05:48:12,627 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 05:48:12,627 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 05:48:12,627 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 05:48:12,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 05:48:12,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 05:48:12,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 05:48:12,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 05:48:12,628 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 05:48:12,628 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 05:48:12,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 05:48:12,629 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 05:48:12,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 05:48:12,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 05:48:12,629 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2019-01-12 05:48:12,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 05:48:12,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 05:48:12,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 05:48:12,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 05:48:12,681 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 05:48:12,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_security_true-unreach-call_false-termination.c [2019-01-12 05:48:12,740 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df232655c/13e915634c6f454d84c6de3a6262cff8/FLAGc7f2064ec [2019-01-12 05:48:13,145 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 05:48:13,146 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_security_true-unreach-call_false-termination.c [2019-01-12 05:48:13,156 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df232655c/13e915634c6f454d84c6de3a6262cff8/FLAGc7f2064ec [2019-01-12 05:48:13,490 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df232655c/13e915634c6f454d84c6de3a6262cff8 [2019-01-12 05:48:13,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 05:48:13,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 05:48:13,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 05:48:13,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 05:48:13,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 05:48:13,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7045d129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13, skipping insertion in model container [2019-01-12 05:48:13,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 05:48:13,550 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 05:48:13,761 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:48:13,767 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 05:48:13,807 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:48:13,822 INFO L195 MainTranslator]: Completed translation [2019-01-12 05:48:13,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13 WrapperNode [2019-01-12 05:48:13,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 05:48:13,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 05:48:13,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 05:48:13,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 05:48:13,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 05:48:13,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 05:48:13,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 05:48:13,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 05:48:13,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (1/1) ... [2019-01-12 05:48:13,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 05:48:13,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 05:48:13,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 05:48:13,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 05:48:13,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (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 [2019-01-12 05:48:14,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 05:48:14,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 05:48:14,744 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 05:48:14,744 INFO L286 CfgBuilder]: Removed 22 assue(true) statements. [2019-01-12 05:48:14,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:48:14 BoogieIcfgContainer [2019-01-12 05:48:14,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 05:48:14,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 05:48:14,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 05:48:14,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 05:48:14,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:48:13" (1/3) ... [2019-01-12 05:48:14,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e0b1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:48:14, skipping insertion in model container [2019-01-12 05:48:14,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:48:13" (2/3) ... [2019-01-12 05:48:14,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e0b1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:48:14, skipping insertion in model container [2019-01-12 05:48:14,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:48:14" (3/3) ... [2019-01-12 05:48:14,754 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2019-01-12 05:48:14,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 05:48:14,772 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 05:48:14,789 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 05:48:14,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 05:48:14,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 05:48:14,826 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 05:48:14,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 05:48:14,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 05:48:14,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 05:48:14,827 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 05:48:14,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 05:48:14,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 05:48:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-01-12 05:48:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 05:48:14,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:14,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:14,855 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2019-01-12 05:48:14,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:14,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 05:48:14,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 05:48:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 05:48:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:48:14,998 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-01-12 05:48:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:15,032 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2019-01-12 05:48:15,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 05:48:15,033 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-12 05:48:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:15,044 INFO L225 Difference]: With dead ends: 154 [2019-01-12 05:48:15,045 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 05:48:15,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:48:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 05:48:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 05:48:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 05:48:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-01-12 05:48:15,083 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2019-01-12 05:48:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:15,084 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-01-12 05:48:15,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 05:48:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-01-12 05:48:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 05:48:15,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:15,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:15,086 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2019-01-12 05:48:15,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:15,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:15,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:15,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:15,124 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2019-01-12 05:48:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:15,286 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-01-12 05:48:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:15,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 05:48:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:15,289 INFO L225 Difference]: With dead ends: 149 [2019-01-12 05:48:15,289 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 05:48:15,290 INFO L631 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 [2019-01-12 05:48:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 05:48:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-12 05:48:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 05:48:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-01-12 05:48:15,301 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2019-01-12 05:48:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:15,301 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-01-12 05:48:15,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-01-12 05:48:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 05:48:15,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:15,303 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:15,303 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2019-01-12 05:48:15,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:15,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:15,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:15,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:15,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:15,382 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-01-12 05:48:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:15,693 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2019-01-12 05:48:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:15,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 05:48:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:15,695 INFO L225 Difference]: With dead ends: 142 [2019-01-12 05:48:15,695 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 05:48:15,698 INFO L631 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 [2019-01-12 05:48:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 05:48:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 05:48:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 05:48:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-01-12 05:48:15,705 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2019-01-12 05:48:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:15,706 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-01-12 05:48:15,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-01-12 05:48:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 05:48:15,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:15,707 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:15,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2019-01-12 05:48:15,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:15,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:15,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:15,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:15,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:15,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:15,787 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2019-01-12 05:48:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:16,213 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-01-12 05:48:16,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:16,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 05:48:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:16,215 INFO L225 Difference]: With dead ends: 188 [2019-01-12 05:48:16,215 INFO L226 Difference]: Without dead ends: 118 [2019-01-12 05:48:16,216 INFO L631 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 [2019-01-12 05:48:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-12 05:48:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-01-12 05:48:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 05:48:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2019-01-12 05:48:16,226 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2019-01-12 05:48:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:16,227 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2019-01-12 05:48:16,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2019-01-12 05:48:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 05:48:16,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:16,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:16,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash 290326405, now seen corresponding path program 1 times [2019-01-12 05:48:16,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:48:16,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:16,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:16,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:16,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:16,269 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2019-01-12 05:48:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:16,323 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2019-01-12 05:48:16,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:16,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 05:48:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:16,326 INFO L225 Difference]: With dead ends: 179 [2019-01-12 05:48:16,326 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 05:48:16,327 INFO L631 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 [2019-01-12 05:48:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 05:48:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-01-12 05:48:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-12 05:48:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-01-12 05:48:16,338 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2019-01-12 05:48:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:16,340 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-01-12 05:48:16,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-01-12 05:48:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 05:48:16,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:16,345 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:16,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1696736468, now seen corresponding path program 1 times [2019-01-12 05:48:16,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:16,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:16,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:16,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:16,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:16,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:16,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:16,407 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2019-01-12 05:48:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:16,452 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2019-01-12 05:48:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:16,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 05:48:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:16,454 INFO L225 Difference]: With dead ends: 130 [2019-01-12 05:48:16,454 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 05:48:16,455 INFO L631 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 [2019-01-12 05:48:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 05:48:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-12 05:48:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 05:48:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2019-01-12 05:48:16,461 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2019-01-12 05:48:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:16,461 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-01-12 05:48:16,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2019-01-12 05:48:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 05:48:16,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:16,463 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:16,463 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2019-01-12 05:48:16,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:16,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:16,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:16,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:16,539 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2019-01-12 05:48:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:16,891 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-01-12 05:48:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:16,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 05:48:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:16,894 INFO L225 Difference]: With dead ends: 154 [2019-01-12 05:48:16,894 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 05:48:16,896 INFO L631 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 [2019-01-12 05:48:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 05:48:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-01-12 05:48:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-12 05:48:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2019-01-12 05:48:16,905 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2019-01-12 05:48:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:16,907 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2019-01-12 05:48:16,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2019-01-12 05:48:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 05:48:16,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:16,908 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:16,910 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:16,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1584038971, now seen corresponding path program 1 times [2019-01-12 05:48:16,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:16,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:16,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:16,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:16,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:16,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:16,961 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2019-01-12 05:48:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:17,205 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2019-01-12 05:48:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:17,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 05:48:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:17,208 INFO L225 Difference]: With dead ends: 162 [2019-01-12 05:48:17,208 INFO L226 Difference]: Without dead ends: 88 [2019-01-12 05:48:17,209 INFO L631 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 [2019-01-12 05:48:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-12 05:48:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-12 05:48:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 05:48:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-01-12 05:48:17,224 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2019-01-12 05:48:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:17,224 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-01-12 05:48:17,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-01-12 05:48:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 05:48:17,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:17,228 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:17,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1447684816, now seen corresponding path program 1 times [2019-01-12 05:48:17,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:17,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:17,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:17,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:17,274 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2019-01-12 05:48:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:17,342 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-01-12 05:48:17,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:17,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 05:48:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:17,344 INFO L225 Difference]: With dead ends: 135 [2019-01-12 05:48:17,344 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 05:48:17,344 INFO L631 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 [2019-01-12 05:48:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 05:48:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 05:48:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 05:48:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-01-12 05:48:17,350 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2019-01-12 05:48:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:17,351 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-01-12 05:48:17,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-01-12 05:48:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 05:48:17,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:17,354 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:17,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash -573380405, now seen corresponding path program 1 times [2019-01-12 05:48:17,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:17,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:17,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:17,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:17,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:17,402 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2019-01-12 05:48:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:17,503 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-01-12 05:48:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:17,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-12 05:48:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:17,505 INFO L225 Difference]: With dead ends: 70 [2019-01-12 05:48:17,506 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 05:48:17,507 INFO L631 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 [2019-01-12 05:48:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 05:48:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-12 05:48:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 05:48:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-01-12 05:48:17,512 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2019-01-12 05:48:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:17,514 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-01-12 05:48:17,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-01-12 05:48:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 05:48:17,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:17,516 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:17,516 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2019-01-12 05:48:17,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:17,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:17,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:17,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:17,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:17,572 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-01-12 05:48:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:17,642 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2019-01-12 05:48:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:17,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-12 05:48:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:17,644 INFO L225 Difference]: With dead ends: 107 [2019-01-12 05:48:17,644 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 05:48:17,645 INFO L631 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 [2019-01-12 05:48:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 05:48:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 05:48:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 05:48:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 05:48:17,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-01-12 05:48:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:17,647 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 05:48:17,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 05:48:17,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 05:48:17,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 05:48:17,802 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-01-12 05:48:17,802 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-01-12 05:48:17,803 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-01-12 05:48:17,804 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-01-12 05:48:17,805 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-01-12 05:48:17,807 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= ULTIMATE.start_main_~this_state~0 3)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-01-12 05:48:17,807 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-01-12 05:48:17,807 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-01-12 05:48:17,807 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-01-12 05:48:17,807 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-01-12 05:48:17,807 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-01-12 05:48:17,808 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L444 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-01-12 05:48:17,809 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L451 ceAbstractionStarter]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-01-12 05:48:17,810 INFO L448 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-01-12 05:48:17,811 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-01-12 05:48:17,812 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-01-12 05:48:17,812 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-01-12 05:48:17,813 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L444 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (<= 4 ULTIMATE.start_main_~q~0) (= ULTIMATE.start_main_~this_state~0 3)) (and (= ULTIMATE.start_main_~q~0 3) (= ULTIMATE.start_main_~this_state~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-01-12 05:48:17,814 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-01-12 05:48:17,815 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-01-12 05:48:17,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:48:17 BoogieIcfgContainer [2019-01-12 05:48:17,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 05:48:17,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 05:48:17,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 05:48:17,832 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 05:48:17,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:48:14" (3/4) ... [2019-01-12 05:48:17,837 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 05:48:17,851 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 05:48:17,851 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 05:48:17,893 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 05:48:17,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 05:48:17,894 INFO L168 Benchmark]: Toolchain (without parser) took 4399.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 948.7 MB in the beginning and 941.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 143.0 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,896 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:17,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.22 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:17,898 INFO L168 Benchmark]: Boogie Preprocessor took 104.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,900 INFO L168 Benchmark]: RCFGBuilder took 766.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,901 INFO L168 Benchmark]: TraceAbstraction took 3084.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 143.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,902 INFO L168 Benchmark]: Witness Printer took 61.55 ms. Allocated memory is still 1.2 GB. Free memory was 948.3 MB in the beginning and 941.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:17,908 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.22 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 766.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3084.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 143.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 11.5 GB. * Witness Printer took 61.55 ms. Allocated memory is still 1.2 GB. Free memory was 948.3 MB in the beginning and 941.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((4 <= q && this_state == 3) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && this_state == 3) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...