./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_io_1_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 69c831b1eda23dac6e2f4454b4feebfba511ade3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 00:39:53,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 00:39:53,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 00:39:53,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 00:39:53,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 00:39:53,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 00:39:53,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 00:39:53,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 00:39:53,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 00:39:53,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 00:39:53,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 00:39:53,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 00:39:53,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 00:39:53,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 00:39:53,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 00:39:53,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 00:39:53,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 00:39:53,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 00:39:53,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 00:39:53,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 00:39:53,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 00:39:53,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 00:39:53,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 00:39:53,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 00:39:53,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 00:39:53,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 00:39:53,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 00:39:53,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 00:39:53,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 00:39:53,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 00:39:53,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 00:39:53,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 00:39:53,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 00:39:53,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 00:39:53,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 00:39:53,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 00:39:53,102 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 00:39:53,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 00:39:53,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 00:39:53,133 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 00:39:53,133 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 00:39:53,133 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 00:39:53,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 00:39:53,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 00:39:53,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 00:39:53,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 00:39:53,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 00:39:53,137 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 00:39:53,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 00:39:53,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 00:39:53,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 00:39:53,138 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 00:39:53,138 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 00:39:53,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 00:39:53,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 00:39:53,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 00:39:53,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 00:39:53,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 00:39:53,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 00:39:53,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 00:39:53,139 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 -> 69c831b1eda23dac6e2f4454b4feebfba511ade3 [2018-12-31 00:39:53,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 00:39:53,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 00:39:53,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 00:39:53,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 00:39:53,221 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 00:39:53,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-12-31 00:39:53,289 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dca671ad/0fe5e3f872ce4dc68651345126f408b4/FLAG64e32acd6 [2018-12-31 00:39:53,800 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 00:39:53,801 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_io_1_true-unreach-call_false-termination.c [2018-12-31 00:39:53,811 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dca671ad/0fe5e3f872ce4dc68651345126f408b4/FLAG64e32acd6 [2018-12-31 00:39:54,115 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dca671ad/0fe5e3f872ce4dc68651345126f408b4 [2018-12-31 00:39:54,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 00:39:54,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 00:39:54,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 00:39:54,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 00:39:54,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 00:39:54,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762fb217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54, skipping insertion in model container [2018-12-31 00:39:54,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 00:39:54,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 00:39:54,418 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:39:54,432 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 00:39:54,472 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:39:54,495 INFO L195 MainTranslator]: Completed translation [2018-12-31 00:39:54,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54 WrapperNode [2018-12-31 00:39:54,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 00:39:54,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 00:39:54,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 00:39:54,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 00:39:54,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 00:39:54,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 00:39:54,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 00:39:54,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 00:39:54,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (1/1) ... [2018-12-31 00:39:54,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 00:39:54,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 00:39:54,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 00:39:54,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 00:39:54,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (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-12-31 00:39:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 00:39:54,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 00:39:55,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 00:39:55,484 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-31 00:39:55,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:55 BoogieIcfgContainer [2018-12-31 00:39:55,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 00:39:55,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 00:39:55,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 00:39:55,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 00:39:55,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 12:39:54" (1/3) ... [2018-12-31 00:39:55,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56932b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:39:55, skipping insertion in model container [2018-12-31 00:39:55,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:54" (2/3) ... [2018-12-31 00:39:55,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56932b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:39:55, skipping insertion in model container [2018-12-31 00:39:55,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:55" (3/3) ... [2018-12-31 00:39:55,493 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_io_1_true-unreach-call_false-termination.c [2018-12-31 00:39:55,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 00:39:55,509 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 00:39:55,525 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 00:39:55,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 00:39:55,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 00:39:55,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 00:39:55,560 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 00:39:55,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 00:39:55,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 00:39:55,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 00:39:55,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 00:39:55,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 00:39:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-12-31 00:39:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 00:39:55,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:55,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:55,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:55,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:55,594 INFO L82 PathProgramCache]: Analyzing trace with hash 352571312, now seen corresponding path program 1 times [2018-12-31 00:39:55,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:55,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:55,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 00:39:55,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 00:39:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 00:39:55,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 00:39:55,744 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-12-31 00:39:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:55,774 INFO L93 Difference]: Finished difference Result 130 states and 244 transitions. [2018-12-31 00:39:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 00:39:55,776 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-31 00:39:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:55,789 INFO L225 Difference]: With dead ends: 130 [2018-12-31 00:39:55,789 INFO L226 Difference]: Without dead ends: 57 [2018-12-31 00:39:55,793 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 [2018-12-31 00:39:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-31 00:39:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-31 00:39:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-31 00:39:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2018-12-31 00:39:55,830 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 9 [2018-12-31 00:39:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:55,831 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2018-12-31 00:39:55,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 00:39:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2018-12-31 00:39:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 00:39:55,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:55,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:55,832 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697760, now seen corresponding path program 1 times [2018-12-31 00:39:55,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:55,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:55,878 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand 3 states. [2018-12-31 00:39:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:56,122 INFO L93 Difference]: Finished difference Result 115 states and 176 transitions. [2018-12-31 00:39:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:56,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-31 00:39:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:56,124 INFO L225 Difference]: With dead ends: 115 [2018-12-31 00:39:56,124 INFO L226 Difference]: Without dead ends: 60 [2018-12-31 00:39:56,127 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 [2018-12-31 00:39:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-31 00:39:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-31 00:39:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 00:39:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2018-12-31 00:39:56,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 10 [2018-12-31 00:39:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:56,136 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-12-31 00:39:56,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2018-12-31 00:39:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 00:39:56,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:56,137 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:56,138 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 658032531, now seen corresponding path program 1 times [2018-12-31 00:39:56,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:56,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:56,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:56,202 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 3 states. [2018-12-31 00:39:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:56,288 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2018-12-31 00:39:56,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:56,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-31 00:39:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:56,291 INFO L225 Difference]: With dead ends: 109 [2018-12-31 00:39:56,291 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 00:39:56,292 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 [2018-12-31 00:39:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 00:39:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-31 00:39:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 00:39:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2018-12-31 00:39:56,299 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 15 [2018-12-31 00:39:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:56,300 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2018-12-31 00:39:56,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2018-12-31 00:39:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 00:39:56,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:56,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:56,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2017993163, now seen corresponding path program 1 times [2018-12-31 00:39:56,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:56,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:56,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:56,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:56,390 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 3 states. [2018-12-31 00:39:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:56,520 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2018-12-31 00:39:56,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:56,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-31 00:39:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:56,522 INFO L225 Difference]: With dead ends: 136 [2018-12-31 00:39:56,522 INFO L226 Difference]: Without dead ends: 90 [2018-12-31 00:39:56,523 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 [2018-12-31 00:39:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-31 00:39:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-12-31 00:39:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 00:39:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2018-12-31 00:39:56,533 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 20 [2018-12-31 00:39:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:56,533 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2018-12-31 00:39:56,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2018-12-31 00:39:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 00:39:56,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:56,535 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:56,535 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 398483104, now seen corresponding path program 1 times [2018-12-31 00:39:56,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:56,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:56,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:56,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:56,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:56,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:56,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:56,618 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand 3 states. [2018-12-31 00:39:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:56,761 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2018-12-31 00:39:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:56,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-31 00:39:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:56,764 INFO L225 Difference]: With dead ends: 176 [2018-12-31 00:39:56,764 INFO L226 Difference]: Without dead ends: 97 [2018-12-31 00:39:56,765 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 [2018-12-31 00:39:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-31 00:39:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-12-31 00:39:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-31 00:39:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2018-12-31 00:39:56,775 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 21 [2018-12-31 00:39:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:56,776 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2018-12-31 00:39:56,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2018-12-31 00:39:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 00:39:56,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:56,778 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:56,778 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash -162530645, now seen corresponding path program 1 times [2018-12-31 00:39:56,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 00:39:56,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:56,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:56,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:56,888 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand 3 states. [2018-12-31 00:39:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:56,937 INFO L93 Difference]: Finished difference Result 160 states and 230 transitions. [2018-12-31 00:39:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:56,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 00:39:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:56,942 INFO L225 Difference]: With dead ends: 160 [2018-12-31 00:39:56,942 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 00:39:56,943 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 [2018-12-31 00:39:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 00:39:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-31 00:39:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-31 00:39:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2018-12-31 00:39:56,966 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 32 [2018-12-31 00:39:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:56,967 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2018-12-31 00:39:56,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2018-12-31 00:39:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 00:39:56,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:56,971 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, 1, 1, 1, 1] [2018-12-31 00:39:56,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1521721792, now seen corresponding path program 1 times [2018-12-31 00:39:56,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:56,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 00:39:57,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:57,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 00:39:57,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 00:39:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 00:39:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:39:57,141 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand 4 states. [2018-12-31 00:39:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:57,250 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2018-12-31 00:39:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 00:39:57,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-31 00:39:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:57,251 INFO L225 Difference]: With dead ends: 76 [2018-12-31 00:39:57,251 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 00:39:57,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 00:39:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 00:39:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 00:39:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 00:39:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 00:39:57,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-31 00:39:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:57,254 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 00:39:57,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 00:39:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 00:39:57,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 00:39:57,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 00:39:57,381 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-12-31 00:39:57,754 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2018-12-31 00:39:57,758 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2018-12-31 00:39:57,759 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2018-12-31 00:39:57,759 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2018-12-31 00:39:57,759 INFO L444 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_sink~0 0))) (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2018-12-31 00:39:57,759 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2018-12-31 00:39:57,759 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2018-12-31 00:39:57,760 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2018-12-31 00:39:57,761 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and (= ULTIMATE.start_main_~this_sink~0 0) (= ULTIMATE.start_main_~q~0 0))) [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-12-31 00:39:57,762 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2018-12-31 00:39:57,763 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-12-31 00:39:57,764 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L444 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 00:39:57,765 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2018-12-31 00:39:57,766 INFO L451 ceAbstractionStarter]: At program point L13(lines 13 344) the Hoare annotation is: true [2018-12-31 00:39:57,766 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2018-12-31 00:39:57,767 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 00:39:57,767 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2018-12-31 00:39:57,767 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2018-12-31 00:39:57,767 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2018-12-31 00:39:57,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 12:39:57 BoogieIcfgContainer [2018-12-31 00:39:57,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 00:39:57,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 00:39:57,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 00:39:57,787 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 00:39:57,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:55" (3/4) ... [2018-12-31 00:39:57,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 00:39:57,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 00:39:57,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 00:39:57,855 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 00:39:57,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 00:39:57,856 INFO L168 Benchmark]: Toolchain (without parser) took 3737.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -61.6 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-12-31 00:39:57,858 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. [2018-12-31 00:39:57,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.85 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 00:39:57,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.50 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 00:39:57,860 INFO L168 Benchmark]: Boogie Preprocessor took 98.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 00:39:57,861 INFO L168 Benchmark]: RCFGBuilder took 833.57 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-12-31 00:39:57,861 INFO L168 Benchmark]: TraceAbstraction took 2299.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. [2018-12-31 00:39:57,862 INFO L168 Benchmark]: Witness Printer took 69.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 00:39:57,867 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 373.85 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 55.50 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 833.57 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2299.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 99.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (this_sink == 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (this_sink == 0 && q == 2)) || (this_sink == 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 520 SDtfs, 190 SDslu, 262 SDs, 0 SdLazy, 88 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 4 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 7219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...