./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37028c56b7915050ee6a79b5e737b9e44bf7c3db ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 01:55:17,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:55:17,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:55:17,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:55:17,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:55:17,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:55:17,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:55:17,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:55:17,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:55:17,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:55:17,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:55:17,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:55:17,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:55:17,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:55:17,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:55:17,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:55:17,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:55:17,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:55:17,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:55:17,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:55:17,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:55:17,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:55:17,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:55:17,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:55:17,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:55:17,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:55:17,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:55:17,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:55:17,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:55:17,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:55:17,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:55:17,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:55:17,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:55:17,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:55:17,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:55:17,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:55:17,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:55:17,494 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:55:17,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:55:17,499 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:55:17,500 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:55:17,500 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:55:17,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:55:17,501 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:55:17,501 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:55:17,502 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:55:17,503 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:55:17,503 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:55:17,503 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:55:17,503 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:55:17,503 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:55:17,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:55:17,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:55:17,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:55:17,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:55:17,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:55:17,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:55:17,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:55:17,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:55:17,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:55:17,507 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:55:17,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:55:17,508 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 ! overflow) ) 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 -> 37028c56b7915050ee6a79b5e737b9e44bf7c3db [2019-01-14 01:55:17,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:55:17,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:55:17,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:55:17,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:55:17,593 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:55:17,594 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:55:17,659 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d865240f/e38dfe22201a4e6696a63461d6031ff3/FLAG39e485638 [2019-01-14 01:55:18,115 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:55:18,117 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:55:18,124 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d865240f/e38dfe22201a4e6696a63461d6031ff3/FLAG39e485638 [2019-01-14 01:55:18,472 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d865240f/e38dfe22201a4e6696a63461d6031ff3 [2019-01-14 01:55:18,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:55:18,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:55:18,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:55:18,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:55:18,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:55:18,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117c6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18, skipping insertion in model container [2019-01-14 01:55:18,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:55:18,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:55:18,685 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:55:18,689 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:55:18,706 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:55:18,720 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:55:18,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18 WrapperNode [2019-01-14 01:55:18,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:55:18,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:55:18,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:55:18,722 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:55:18,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:55:18,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:55:18,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:55:18,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:55:18,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (1/1) ... [2019-01-14 01:55:18,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:55:18,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:55:18,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:55:18,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:55:18,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (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-14 01:55:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:55:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:55:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2019-01-14 01:55:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2019-01-14 01:55:19,250 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:55:19,250 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:55:19,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:55:19 BoogieIcfgContainer [2019-01-14 01:55:19,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:55:19,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:55:19,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:55:19,256 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:55:19,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:55:18" (1/3) ... [2019-01-14 01:55:19,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b4939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:55:19, skipping insertion in model container [2019-01-14 01:55:19,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:55:18" (2/3) ... [2019-01-14 01:55:19,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b4939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:55:19, skipping insertion in model container [2019-01-14 01:55:19,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:55:19" (3/3) ... [2019-01-14 01:55:19,259 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91_false-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:55:19,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:55:19,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:55:19,290 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:55:19,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:55:19,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:55:19,322 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:55:19,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:55:19,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:55:19,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:55:19,323 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:55:19,323 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:55:19,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:55:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 01:55:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:55:19,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:19,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:55:19,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 31043311, now seen corresponding path program 1 times [2019-01-14 01:55:19,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:19,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:19,541 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-14 01:55:19,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:55:19,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:55:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:55:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:55:19,565 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2019-01-14 01:55:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:20,096 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-01-14 01:55:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:55:20,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-14 01:55:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:20,111 INFO L225 Difference]: With dead ends: 52 [2019-01-14 01:55:20,111 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 01:55:20,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:55:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 01:55:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-01-14 01:55:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 01:55:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-01-14 01:55:20,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 5 [2019-01-14 01:55:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:20,160 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-01-14 01:55:20,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:55:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-01-14 01:55:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:55:20,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:20,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:55:20,162 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 31043471, now seen corresponding path program 1 times [2019-01-14 01:55:20,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:20,190 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-14 01:55:20,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:20,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:55:20,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:55:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:55:20,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:55:20,194 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2019-01-14 01:55:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:20,264 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-01-14 01:55:20,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:55:20,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 01:55:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:20,266 INFO L225 Difference]: With dead ends: 40 [2019-01-14 01:55:20,267 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 01:55:20,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:55:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 01:55:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-01-14 01:55:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 01:55:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-01-14 01:55:20,279 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2019-01-14 01:55:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:20,280 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-14 01:55:20,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:55:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-01-14 01:55:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:55:20,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:20,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:55:20,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash 962342709, now seen corresponding path program 1 times [2019-01-14 01:55:20,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:20,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:20,351 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-14 01:55:20,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:20,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:55:20,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:55:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:55:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:55:20,352 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2019-01-14 01:55:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:20,405 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-01-14 01:55:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:55:20,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 01:55:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:20,407 INFO L225 Difference]: With dead ends: 39 [2019-01-14 01:55:20,408 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 01:55:20,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:55:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 01:55:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-01-14 01:55:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 01:55:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-01-14 01:55:20,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 6 [2019-01-14 01:55:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:20,427 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-01-14 01:55:20,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:55:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-01-14 01:55:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:55:20,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:20,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:55:20,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 962347674, now seen corresponding path program 1 times [2019-01-14 01:55:20,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:20,524 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-14 01:55:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:55:20,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:55:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:55:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:55:20,526 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2019-01-14 01:55:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:20,687 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-01-14 01:55:20,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:55:20,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:55:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:20,690 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:55:20,690 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 01:55:20,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:55:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 01:55:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-14 01:55:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 01:55:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-14 01:55:20,707 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 6 [2019-01-14 01:55:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:20,707 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-14 01:55:20,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:55:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-14 01:55:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:55:20,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:20,708 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:55:20,709 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash -703912792, now seen corresponding path program 1 times [2019-01-14 01:55:20,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:20,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:20,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:20,859 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-14 01:55:20,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:20,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:55:20,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:55:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:55:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:55:20,861 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 5 states. [2019-01-14 01:55:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:20,987 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-01-14 01:55:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:55:20,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 01:55:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:20,990 INFO L225 Difference]: With dead ends: 68 [2019-01-14 01:55:20,990 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 01:55:20,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:55:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 01:55:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2019-01-14 01:55:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 01:55:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-01-14 01:55:21,021 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 10 [2019-01-14 01:55:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:21,022 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-01-14 01:55:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:55:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-01-14 01:55:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:55:21,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:21,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:55:21,024 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1217128367, now seen corresponding path program 1 times [2019-01-14 01:55:21,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:21,074 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-14 01:55:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:55:21,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:55:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:55:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:55:21,077 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 4 states. [2019-01-14 01:55:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:21,092 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-01-14 01:55:21,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:55:21,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-14 01:55:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:21,095 INFO L225 Difference]: With dead ends: 58 [2019-01-14 01:55:21,095 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 01:55:21,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:55:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 01:55:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-14 01:55:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 01:55:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-14 01:55:21,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 13 [2019-01-14 01:55:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:21,107 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-14 01:55:21,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:55:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-14 01:55:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 01:55:21,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:21,109 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:55:21,110 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash -843390153, now seen corresponding path program 1 times [2019-01-14 01:55:21,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:21,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:21,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:55:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:21,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:55:21,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:55:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:55:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:55:21,180 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2019-01-14 01:55:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:21,652 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-01-14 01:55:21,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:55:21,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 01:55:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:21,654 INFO L225 Difference]: With dead ends: 52 [2019-01-14 01:55:21,655 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 01:55:21,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:55:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 01:55:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-01-14 01:55:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 01:55:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-01-14 01:55:21,665 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2019-01-14 01:55:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:21,665 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-01-14 01:55:21,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:55:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-01-14 01:55:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:55:21,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:55:21,667 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:55:21,667 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:55:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:55:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -375285934, now seen corresponding path program 1 times [2019-01-14 01:55:21,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:55:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:55:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:55:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:55:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:55:21,745 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-14 01:55:21,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:55:21,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:55:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:55:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:55:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:55:21,747 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2019-01-14 01:55:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:55:21,893 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-14 01:55:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:55:21,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 01:55:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:55:21,895 INFO L225 Difference]: With dead ends: 48 [2019-01-14 01:55:21,896 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:55:21,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:55:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:55:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:55:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:55:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:55:21,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-14 01:55:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:55:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:55:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:55:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:55:21,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:55:21,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:55:22,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:55:22,174 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,174 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,174 INFO L448 ceAbstractionStarter]: For program point L27-2(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,174 INFO L448 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,174 INFO L448 ceAbstractionStarter]: For program point L27-4(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point L27-6(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point L27-7(lines 27 31) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:55:22,175 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:55:22,176 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) [2019-01-14 01:55:22,176 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:55:22,176 INFO L444 ceAbstractionStarter]: At program point L24(lines 24 32) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2019-01-14 01:55:22,177 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,178 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-14 01:55:22,178 INFO L444 ceAbstractionStarter]: At program point L19-2(line 19) the Hoare annotation is: (or (< (+ |f91_#in~x| 2147483648) 0) (and (<= f91_~x 100) (<= 0 (+ f91_~x 2147483648))) (< 2147483647 |f91_#in~x|)) [2019-01-14 01:55:22,178 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-01-14 01:55:22,178 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-01-14 01:55:22,178 INFO L448 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,178 INFO L444 ceAbstractionStarter]: At program point L19-4(line 19) the Hoare annotation is: (or (< (+ |f91_#in~x| 2147483648) 0) (< 2147483647 |f91_#in~x|) (and (<= |f91_#t~ret0| 2147483647) (<= 0 (+ |f91_#t~ret0| 2147483648)) (<= f91_~x 100) (<= 0 (+ f91_~x 2147483648)))) [2019-01-14 01:55:22,179 INFO L448 ceAbstractionStarter]: For program point L19-5(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,179 INFO L451 ceAbstractionStarter]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2019-01-14 01:55:22,179 INFO L448 ceAbstractionStarter]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2019-01-14 01:55:22,179 INFO L448 ceAbstractionStarter]: For program point f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2019-01-14 01:55:22,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:55:22 BoogieIcfgContainer [2019-01-14 01:55:22,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:55:22,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:55:22,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:55:22,193 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:55:22,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:55:19" (3/4) ... [2019-01-14 01:55:22,197 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:55:22,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f91 [2019-01-14 01:55:22,209 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 01:55:22,209 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:55:22,263 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:55:22,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:55:22,264 INFO L168 Benchmark]: Toolchain (without parser) took 3788.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 952.7 MB in the beginning and 963.6 MB in the end (delta: -10.9 MB). Peak memory consumption was 106.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:55:22,265 INFO L168 Benchmark]: CDTParser took 0.16 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-14 01:55:22,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.58 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:55:22,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.39 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:55:22,267 INFO L168 Benchmark]: Boogie Preprocessor took 18.78 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:55:22,267 INFO L168 Benchmark]: RCFGBuilder took 482.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:55:22,268 INFO L168 Benchmark]: TraceAbstraction took 2939.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.6 MB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:55:22,269 INFO L168 Benchmark]: Witness Printer took 70.10 ms. Allocated memory is still 1.1 GB. Free memory is still 963.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:55:22,272 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.16 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 243.58 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.39 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.78 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 482.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2939.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.6 MB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 11.5 GB. * Witness Printer took 70.10 ms. Allocated memory is still 1.1 GB. Free memory is still 963.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 6 error locations. SAFE Result, 2.8s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 141 SDslu, 229 SDs, 0 SdLazy, 235 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 29 PreInvPairs, 30 NumberOfFragments, 61 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...