./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 554582d6fc3de8e87f5dd30e5019302b6e1b96be ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31:28,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:31:28,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:31:28,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:31:28,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:31:28,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:31:28,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:31:28,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:31:28,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:31:28,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:31:28,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:31:28,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:31:28,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:31:28,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:31:28,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:31:28,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:31:28,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:31:28,877 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:31:28,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:31:28,881 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:31:28,882 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:31:28,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:31:28,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:31:28,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:31:28,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:31:28,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:31:28,889 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:31:28,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:31:28,891 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:31:28,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:31:28,892 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:31:28,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:31:28,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:31:28,893 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:31:28,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:31:28,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:31:28,895 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:31:28,910 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:31:28,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:31:28,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:31:28,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:31:28,912 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:31:28,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:31:28,912 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:31:28,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:31:28,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:31:28,915 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:31:28,916 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:31:28,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:31:28,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:31:28,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:31:28,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:31:28,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:31:28,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:31:28,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:31:28,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:31:28,917 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:31:28,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:31:28,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:31:28,918 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 554582d6fc3de8e87f5dd30e5019302b6e1b96be [2019-01-14 01:31:28,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:31:28,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:31:28,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:31:28,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:31:28,981 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:31:28,982 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2019-01-14 01:31:29,047 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713c19b94/def4cff4dfb849ce8386a2762f9e5a55/FLAG3d353360c [2019-01-14 01:31:29,432 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:31:29,433 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2019-01-14 01:31:29,437 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713c19b94/def4cff4dfb849ce8386a2762f9e5a55/FLAG3d353360c [2019-01-14 01:31:29,837 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713c19b94/def4cff4dfb849ce8386a2762f9e5a55 [2019-01-14 01:31:29,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:31:29,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:31:29,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:31:29,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:31:29,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:31:29,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:31:29" (1/1) ... [2019-01-14 01:31:29,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:29, skipping insertion in model container [2019-01-14 01:31:29,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:31:29" (1/1) ... [2019-01-14 01:31:29,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:31:29,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:31:30,086 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:31:30,091 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:31:30,113 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:31:30,130 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:31:30,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30 WrapperNode [2019-01-14 01:31:30,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:31:30,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:31:30,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:31:30,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:31:30,144 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:31:30" (1/1) ... [2019-01-14 01:31:30,150 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:31:30" (1/1) ... [2019-01-14 01:31:30,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:31:30,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:31:30,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:31:30,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:31:30,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (1/1) ... [2019-01-14 01:31:30,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:31:30,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:31:30,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:31:30,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:31:30,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (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:31:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure p [2019-01-14 01:31:30,321 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2019-01-14 01:31:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:31:30,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:31:30,708 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:31:30,708 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:31:30,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:30 BoogieIcfgContainer [2019-01-14 01:31:30,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:31:30,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:31:30,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:31:30,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:31:30,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:31:29" (1/3) ... [2019-01-14 01:31:30,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faaa6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:31:30, skipping insertion in model container [2019-01-14 01:31:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:31:30" (2/3) ... [2019-01-14 01:31:30,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@faaa6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:31:30, skipping insertion in model container [2019-01-14 01:31:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:30" (3/3) ... [2019-01-14 01:31:30,717 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2019-01-14 01:31:30,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:31:30,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 01:31:30,751 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 01:31:30,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:31:30,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:31:30,790 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:31:30,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:31:30,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:31:30,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:31:30,791 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:31:30,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:31:30,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:31:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 01:31:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:31:30,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:30,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:31:30,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1571177437, now seen corresponding path program 1 times [2019-01-14 01:31:30,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:30,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:30,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:30,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:31,054 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:31:31,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:31,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:31:31,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:31,074 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2019-01-14 01:31:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:31,325 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-01-14 01:31:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:31,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:31:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:31,338 INFO L225 Difference]: With dead ends: 44 [2019-01-14 01:31:31,338 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:31:31,342 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:31:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:31:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-01-14 01:31:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 01:31:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-14 01:31:31,375 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2019-01-14 01:31:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:31,376 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-14 01:31:31,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-14 01:31:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:31:31,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:31,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:31,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1461860328, now seen corresponding path program 1 times [2019-01-14 01:31:31,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:31,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:31,409 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:31:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:31:31,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:31:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:31:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:31:31,413 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-01-14 01:31:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:31,437 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-01-14 01:31:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:31:31,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 01:31:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:31,439 INFO L225 Difference]: With dead ends: 19 [2019-01-14 01:31:31,439 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 01:31:31,440 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:31:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 01:31:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 01:31:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 01:31:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-14 01:31:31,445 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 7 [2019-01-14 01:31:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:31,445 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-14 01:31:31,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:31:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-01-14 01:31:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:31:31,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:31,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:31,447 INFO L423 AbstractCegarLoop]: === Iteration 3 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1461867311, now seen corresponding path program 1 times [2019-01-14 01:31:31,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:31,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:31,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:31,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:31,565 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:31:31,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:31,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:31:31,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:31,567 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2019-01-14 01:31:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:31,882 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-14 01:31:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:31,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:31:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:31,884 INFO L225 Difference]: With dead ends: 30 [2019-01-14 01:31:31,885 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 01:31:31,885 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:31:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 01:31:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-14 01:31:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 01:31:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-01-14 01:31:31,893 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-01-14 01:31:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-14 01:31:31,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-01-14 01:31:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:31:31,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:31,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:31,895 INFO L423 AbstractCegarLoop]: === Iteration 4 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1926753568, now seen corresponding path program 1 times [2019-01-14 01:31:31,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:31,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:31,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:31,968 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:31:31,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:31,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:31:31,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:31:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:31:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:31:31,970 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-01-14 01:31:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:31,983 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-01-14 01:31:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:31:31,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 01:31:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:31,985 INFO L225 Difference]: With dead ends: 24 [2019-01-14 01:31:31,985 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 01:31:31,986 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:31:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 01:31:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-14 01:31:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 01:31:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-14 01:31:31,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2019-01-14 01:31:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:31,992 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-14 01:31:31,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:31:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-14 01:31:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 01:31:31,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:31,993 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:31,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 168982822, now seen corresponding path program 1 times [2019-01-14 01:31:31,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:32,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:32,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:32,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:32,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:31:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:31:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:31:32,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:31:32,203 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-01-14 01:31:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:32,496 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-01-14 01:31:32,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:31:32,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-14 01:31:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:32,499 INFO L225 Difference]: With dead ends: 45 [2019-01-14 01:31:32,499 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 01:31:32,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:31:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 01:31:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-01-14 01:31:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:31:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-14 01:31:32,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 11 [2019-01-14 01:31:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:32,507 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-01-14 01:31:32,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:31:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-01-14 01:31:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:31:32,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:32,509 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:32,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 943507206, now seen corresponding path program 1 times [2019-01-14 01:31:32,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:32,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:32,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:32,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:32,592 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:31:32,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:31:32,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:31:32,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:31:32,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:31:32,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:31:32,595 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-01-14 01:31:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:32,742 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-01-14 01:31:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:31:32,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-14 01:31:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:32,750 INFO L225 Difference]: With dead ends: 41 [2019-01-14 01:31:32,750 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 01:31:32,750 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:31:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 01:31:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2019-01-14 01:31:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:31:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 01:31:32,771 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 12 [2019-01-14 01:31:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:32,772 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 01:31:32,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:31:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 01:31:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:31:32,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:32,777 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:31:32,777 INFO L423 AbstractCegarLoop]: === Iteration 7 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:32,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1019019044, now seen corresponding path program 1 times [2019-01-14 01:31:32,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:32,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:32,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:33,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:33,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:33,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:33,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:31:33,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:31:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:31:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:31:33,157 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-14 01:31:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:33,332 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-01-14 01:31:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:31:33,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 01:31:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:33,334 INFO L225 Difference]: With dead ends: 49 [2019-01-14 01:31:33,334 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 01:31:33,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 01:31:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-01-14 01:31:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 01:31:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-01-14 01:31:33,344 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2019-01-14 01:31:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:33,344 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-01-14 01:31:33,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:31:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-01-14 01:31:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:31:33,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:33,345 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:31:33,346 INFO L423 AbstractCegarLoop]: === Iteration 8 === [pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 781265277, now seen corresponding path program 2 times [2019-01-14 01:31:33,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:33,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:33,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:33,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:33,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:33,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:33,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:33,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-01-14 01:31:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:31:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:31:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:33,619 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 12 states. [2019-01-14 01:31:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:34,495 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2019-01-14 01:31:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:31:34,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-01-14 01:31:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:34,499 INFO L225 Difference]: With dead ends: 132 [2019-01-14 01:31:34,499 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:31:34,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:31:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:31:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:31:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:31:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:31:34,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-01-14 01:31:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:34,503 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:31:34,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:31:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:31:34,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:31:34,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:31:35,452 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-01-14 01:31:35,838 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-01-14 01:31:35,841 INFO L448 ceAbstractionStarter]: For program point pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:31:35,841 INFO L448 ceAbstractionStarter]: For program point pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:31:35,841 INFO L448 ceAbstractionStarter]: For program point pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:31:35,842 INFO L448 ceAbstractionStarter]: For program point pEXIT(lines 12 22) no Hoare annotation was computed. [2019-01-14 01:31:35,842 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-14 01:31:35,842 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-01-14 01:31:35,842 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-01-14 01:31:35,842 INFO L451 ceAbstractionStarter]: At program point pENTRY(lines 12 22) the Hoare annotation is: true [2019-01-14 01:31:35,843 INFO L444 ceAbstractionStarter]: At program point L17-2(line 17) the Hoare annotation is: (let ((.cse0 (< 2147483647 |p_#in~m|)) (.cse1 (< 2147483647 |p_#in~r|))) (and (or (<= p_~n 2147483646) (< 2147483646 |p_#in~n|) .cse0 .cse1) (or (< 2147483647 |p_#in~n|) .cse0 (and (<= p_~n 2147483647) (<= p_~m 2147483647) (<= p_~r 2147483646) (<= 1 p_~n)) .cse1))) [2019-01-14 01:31:35,843 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-14 01:31:35,843 INFO L448 ceAbstractionStarter]: For program point pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-14 01:31:35,843 INFO L448 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. [2019-01-14 01:31:35,843 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. [2019-01-14 01:31:35,843 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-14 01:31:35,844 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (< 2147483647 |p_#in~n|)) (.cse1 (< 2147483647 |p_#in~m|)) (.cse2 (< 2147483647 |p_#in~r|))) (and (or (and (<= p_~n 2147483647) (<= 1 p_~r) (<= p_~m 2147483647) (<= p_~r 2147483647)) .cse0 .cse1 .cse2) (or .cse0 (<= p_~r 2147483646) .cse1 (< 2147483646 |p_#in~r|)) (or (< 2147483646 |p_#in~n|) .cse1 (<= p_~n 2147483646) .cse2))) [2019-01-14 01:31:35,844 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-14 01:31:35,844 INFO L448 ceAbstractionStarter]: For program point pFINAL(lines 12 22) no Hoare annotation was computed. [2019-01-14 01:31:35,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:31:35,844 INFO L444 ceAbstractionStarter]: At program point L31(lines 24 32) the Hoare annotation is: (<= ULTIMATE.start_main_~r~0 2147483647) [2019-01-14 01:31:35,844 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:31:35,845 INFO L444 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= ULTIMATE.start_main_~m~0 2147483647) (<= ULTIMATE.start_main_~r~0 2147483647)) [2019-01-14 01:31:35,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:31:35,845 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:31:35,845 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 01:31:35,845 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:31:35,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:31:35 BoogieIcfgContainer [2019-01-14 01:31:35,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:31:35,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:31:35,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:31:35,859 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:31:35,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:31:30" (3/4) ... [2019-01-14 01:31:35,863 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:31:35,870 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure p [2019-01-14 01:31:35,875 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 01:31:35,875 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:31:35,924 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:31:35,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:31:35,925 INFO L168 Benchmark]: Toolchain (without parser) took 6082.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.4 MB in the beginning and 835.9 MB in the end (delta: 115.4 MB). Peak memory consumption was 249.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:31:35,926 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:31:35,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:31:35,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.65 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:31:35,929 INFO L168 Benchmark]: Boogie Preprocessor took 27.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:31:35,929 INFO L168 Benchmark]: RCFGBuilder took 506.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:31:35,930 INFO L168 Benchmark]: TraceAbstraction took 5147.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.9 MB in the end (delta: 277.7 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:31:35,931 INFO L168 Benchmark]: Witness Printer took 65.49 ms. Allocated memory is still 1.2 GB. Free memory is still 835.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:31:35,935 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 288.40 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 41.65 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.69 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 506.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5147.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 835.9 MB in the end (delta: 277.7 MB). Peak memory consumption was 277.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.49 ms. Allocated memory is still 1.2 GB. Free memory is still 835.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: 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: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: r <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 4 error locations. SAFE Result, 5.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 221 SDslu, 199 SDs, 0 SdLazy, 389 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=7, 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, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 89 PreInvPairs, 89 NumberOfFragments, 116 HoareAnnotationTreeSize, 89 FomulaSimplifications, 3427 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FomulaSimplificationsInter, 708 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 3099 SizeOfPredicates, 7 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 11/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...