./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/gcd02.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 4ba31a8852254650e4ff6b6614669c496c01110f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:53:38,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:53:38,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:53:38,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:53:38,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:53:38,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:53:38,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:53:38,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:53:38,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:53:38,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:53:38,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:53:38,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:53:38,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:53:38,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:53:38,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:53:38,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:53:38,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:53:38,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:53:38,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:53:38,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:53:38,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:53:38,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:53:38,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:53:38,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:53:38,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:53:38,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:53:38,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:53:38,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:53:38,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:53:38,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:53:38,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:53:38,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:53:38,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:53:38,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:53:38,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:53:38,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:53:38,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:53:38,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:53:38,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:53:38,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:53:38,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:53:38,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:53:38,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:53:38,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:53:38,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:53:38,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:53:38,782 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:53:38,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:53:38,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:53:38,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:53:38,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:53:38,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:53:38,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:53:38,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:53:38,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:53:38,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:53:38,785 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:53:38,786 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:53:38,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:53:38,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:53:38,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:53:38,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:53:38,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:53:38,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:53:38,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:53:38,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:53:38,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:53:38,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:53:38,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:53:38,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:53:38,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:53:38,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:53:38,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 4ba31a8852254650e4ff6b6614669c496c01110f [2019-11-28 02:53:39,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:53:39,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:53:39,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:53:39,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:53:39,122 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:53:39,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/gcd02.c [2019-11-28 02:53:39,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5236962db/4924d9c90ccb4236a45164579c4cd082/FLAG806ecb009 [2019-11-28 02:53:39,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:53:39,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/gcd02.c [2019-11-28 02:53:39,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5236962db/4924d9c90ccb4236a45164579c4cd082/FLAG806ecb009 [2019-11-28 02:53:40,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5236962db/4924d9c90ccb4236a45164579c4cd082 [2019-11-28 02:53:40,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:53:40,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:53:40,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:53:40,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:53:40,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:53:40,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388be10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40, skipping insertion in model container [2019-11-28 02:53:40,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:53:40,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:53:40,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:53:40,249 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:53:40,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:53:40,280 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:53:40,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40 WrapperNode [2019-11-28 02:53:40,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:53:40,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:53:40,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:53:40,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:53:40,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:53:40,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:53:40,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:53:40,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:53:40,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (1/1) ... [2019-11-28 02:53:40,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:53:40,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:53:40,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:53:40,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:53:40,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (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-11-28 02:53:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2019-11-28 02:53:40,451 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2019-11-28 02:53:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-11-28 02:53:40,452 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-11-28 02:53:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:53:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:53:40,786 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:53:40,786 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:53:40,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:40 BoogieIcfgContainer [2019-11-28 02:53:40,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:53:40,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:53:40,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:53:40,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:53:40,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:40" (1/3) ... [2019-11-28 02:53:40,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435eb139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:40, skipping insertion in model container [2019-11-28 02:53:40,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:40" (2/3) ... [2019-11-28 02:53:40,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435eb139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:40, skipping insertion in model container [2019-11-28 02:53:40,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:40" (3/3) ... [2019-11-28 02:53:40,796 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd02.c [2019-11-28 02:53:40,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:53:40,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 02:53:40,819 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 02:53:40,841 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:53:40,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:53:40,842 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:53:40,842 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:53:40,842 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:53:40,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:53:40,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:53:40,842 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:53:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-11-28 02:53:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:53:40,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:40,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:40,865 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1549577429, now seen corresponding path program 1 times [2019-11-28 02:53:40,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:40,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276219009] [2019-11-28 02:53:40,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:41,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276219009] [2019-11-28 02:53:41,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:41,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:53:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019917380] [2019-11-28 02:53:41,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:53:41,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:53:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:53:41,164 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2019-11-28 02:53:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:41,429 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-11-28 02:53:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:53:41,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 02:53:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:41,444 INFO L225 Difference]: With dead ends: 82 [2019-11-28 02:53:41,445 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 02:53:41,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:53:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 02:53:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 02:53:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:53:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 02:53:41,516 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2019-11-28 02:53:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 02:53:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:53:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-28 02:53:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:53:41,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:41,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:41,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1549577653, now seen corresponding path program 1 times [2019-11-28 02:53:41,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:41,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153523764] [2019-11-28 02:53:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:41,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153523764] [2019-11-28 02:53:41,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:41,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:53:41,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812631551] [2019-11-28 02:53:41,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:53:41,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:53:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:53:41,594 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-28 02:53:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:41,712 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-11-28 02:53:41,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:53:41,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-28 02:53:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:41,715 INFO L225 Difference]: With dead ends: 31 [2019-11-28 02:53:41,715 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 02:53:41,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:53:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 02:53:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 02:53:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 02:53:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-28 02:53:41,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2019-11-28 02:53:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:41,733 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-28 02:53:41,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:53:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-28 02:53:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:53:41,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:41,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:41,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash -670047346, now seen corresponding path program 1 times [2019-11-28 02:53:41,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:41,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93573414] [2019-11-28 02:53:41,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:41,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93573414] [2019-11-28 02:53:41,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:41,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:53:41,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573500014] [2019-11-28 02:53:41,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:53:41,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:53:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:53:41,893 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 8 states. [2019-11-28 02:53:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:42,094 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-11-28 02:53:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:53:42,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 02:53:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:42,101 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:53:42,104 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:53:42,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:53:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:53:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 02:53:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 02:53:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-11-28 02:53:42,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 16 [2019-11-28 02:53:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:42,132 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-11-28 02:53:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:53:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-11-28 02:53:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:53:42,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:42,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:42,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 703368796, now seen corresponding path program 1 times [2019-11-28 02:53:42,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:42,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102413882] [2019-11-28 02:53:42,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102413882] [2019-11-28 02:53:42,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:53:42,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913034076] [2019-11-28 02:53:42,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:53:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:53:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:53:42,190 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 3 states. [2019-11-28 02:53:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:42,207 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-11-28 02:53:42,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:53:42,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:53:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:42,213 INFO L225 Difference]: With dead ends: 37 [2019-11-28 02:53:42,213 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:53:42,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-28 02:53:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:53:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 02:53:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:53:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-11-28 02:53:42,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2019-11-28 02:53:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:42,232 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-11-28 02:53:42,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:53:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-11-28 02:53:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:53:42,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:42,236 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:42,236 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash 481959190, now seen corresponding path program 1 times [2019-11-28 02:53:42,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:42,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109906424] [2019-11-28 02:53:42,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:42,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109906424] [2019-11-28 02:53:42,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584026939] [2019-11-28 02:53:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 02:53:42,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:42,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:42,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2019-11-28 02:53:42,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502649871] [2019-11-28 02:53:42,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:53:42,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:53:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:53:42,776 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 11 states. [2019-11-28 02:53:43,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:43,014 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-28 02:53:43,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:53:43,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-11-28 02:53:43,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:43,016 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:53:43,016 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:53:43,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-11-28 02:53:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:53:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 02:53:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:53:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-28 02:53:43,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2019-11-28 02:53:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:43,028 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-28 02:53:43,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:53:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-28 02:53:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:53:43,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:43,030 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:43,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:43,232 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash 817476587, now seen corresponding path program 1 times [2019-11-28 02:53:43,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:43,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53211682] [2019-11-28 02:53:43,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:53:43,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53211682] [2019-11-28 02:53:43,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:43,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:53:43,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442778525] [2019-11-28 02:53:43,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:53:43,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:43,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:53:43,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:53:43,348 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 9 states. [2019-11-28 02:53:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:43,542 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-11-28 02:53:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:53:43,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-28 02:53:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:43,547 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:53:43,547 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 02:53:43,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:53:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 02:53:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-28 02:53:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:53:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-11-28 02:53:43,556 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2019-11-28 02:53:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:43,557 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-11-28 02:53:43,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:53:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-11-28 02:53:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:53:43,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:43,559 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:43,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash -957242837, now seen corresponding path program 1 times [2019-11-28 02:53:43,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:43,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845052069] [2019-11-28 02:53:43,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:43,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845052069] [2019-11-28 02:53:43,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461963700] [2019-11-28 02:53:43,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 02:53:43,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:53:43,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:43,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-11-28 02:53:43,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081202238] [2019-11-28 02:53:43,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:53:43,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:53:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:53:43,916 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 10 states. [2019-11-28 02:53:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:44,079 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-11-28 02:53:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:53:44,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 02:53:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:44,081 INFO L225 Difference]: With dead ends: 51 [2019-11-28 02:53:44,082 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:53:44,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:53:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:53:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 02:53:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:53:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-11-28 02:53:44,099 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2019-11-28 02:53:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:44,100 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-11-28 02:53:44,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:53:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-11-28 02:53:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:53:44,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:44,108 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:44,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:44,314 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash -630492237, now seen corresponding path program 1 times [2019-11-28 02:53:44,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:44,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315893360] [2019-11-28 02:53:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:53:44,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315893360] [2019-11-28 02:53:44,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162590718] [2019-11-28 02:53:44,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:53:44,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:53:44,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:44,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2019-11-28 02:53:44,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773402724] [2019-11-28 02:53:44,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:53:44,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:44,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:53:44,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:53:44,830 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 12 states. [2019-11-28 02:53:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:45,027 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-28 02:53:45,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:53:45,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-28 02:53:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:45,029 INFO L225 Difference]: With dead ends: 51 [2019-11-28 02:53:45,029 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 02:53:45,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-11-28 02:53:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 02:53:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 02:53:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:53:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-11-28 02:53:45,036 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 32 [2019-11-28 02:53:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:45,036 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-11-28 02:53:45,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:53:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-11-28 02:53:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:53:45,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:45,038 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:45,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:45,242 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1826368274, now seen corresponding path program 1 times [2019-11-28 02:53:45,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:45,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580312125] [2019-11-28 02:53:45,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 02:53:45,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580312125] [2019-11-28 02:53:45,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031925895] [2019-11-28 02:53:45,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 02:53:45,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:53:45,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:45,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2019-11-28 02:53:45,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653220915] [2019-11-28 02:53:45,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:53:45,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:53:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-11-28 02:53:45,688 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 11 states. [2019-11-28 02:53:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:45,856 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-11-28 02:53:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:53:45,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 02:53:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:45,857 INFO L225 Difference]: With dead ends: 36 [2019-11-28 02:53:45,857 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:53:45,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-11-28 02:53:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:53:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:53:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:53:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:53:45,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-11-28 02:53:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:45,859 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:53:45,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:53:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:53:45,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:53:46,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:46,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:53:46,269 INFO L246 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2019-11-28 02:53:46,269 INFO L246 CegarLoopResult]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2019-11-28 02:53:46,269 INFO L246 CegarLoopResult]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2019-11-28 02:53:46,270 INFO L246 CegarLoopResult]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2019-11-28 02:53:46,270 INFO L246 CegarLoopResult]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2019-11-28 02:53:46,270 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-28 02:53:46,270 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 02:53:46,270 INFO L249 CegarLoopResult]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2019-11-28 02:53:46,270 INFO L242 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (let ((.cse0 (not (<= 1 |divides_#in~n|)))) (and (or (and (<= divides_~m 2147483647) (<= divides_~n divides_~m) (<= 1 divides_~n)) .cse0 (not (<= |divides_#in~m| 2147483647))) (or (not (<= |divides_#in~m| 2147483646)) .cse0 (<= divides_~m 2147483646)))) [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point L37-3(line 37) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-28 02:53:46,271 INFO L246 CegarLoopResult]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-11-28 02:53:46,272 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 02:53:46,272 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-28 02:53:46,272 INFO L242 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (or (not (<= |gcd_#in~y1| 2147483647)) (and (<= gcd_~y2 2147483647) (< 0 gcd_~y1) (= gcd_~y1 |gcd_#in~y1|) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (not (<= |gcd_#in~y2| 2147483647))) [2019-11-28 02:53:46,272 INFO L249 CegarLoopResult]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2019-11-28 02:53:46,272 INFO L246 CegarLoopResult]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-11-28 02:53:46,272 INFO L246 CegarLoopResult]: For program point L26-3(line 26) no Hoare annotation was computed. [2019-11-28 02:53:46,272 INFO L242 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (or (not (<= |gcd_#in~y1| 2147483647)) (and (<= gcd_~y2 2147483647) (< 0 gcd_~y1) (= gcd_~y1 |gcd_#in~y1|) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (not (<= |gcd_#in~y2| 2147483647))) [2019-11-28 02:53:46,272 INFO L246 CegarLoopResult]: For program point L24-3(line 24) no Hoare annotation was computed. [2019-11-28 02:53:46,273 INFO L246 CegarLoopResult]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-11-28 02:53:46,274 INFO L246 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-28 02:53:46,274 INFO L246 CegarLoopResult]: For program point L16(lines 16 19) no Hoare annotation was computed. [2019-11-28 02:53:46,274 INFO L246 CegarLoopResult]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2019-11-28 02:53:46,274 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:53:46,274 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-28 02:53:46,275 INFO L242 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= ULTIMATE.start_main_~m~0 2147483647)) [2019-11-28 02:53:46,275 INFO L246 CegarLoopResult]: For program point L50-1(line 50) no Hoare annotation was computed. [2019-11-28 02:53:46,275 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-28 02:53:46,275 INFO L246 CegarLoopResult]: For program point L42(lines 42 44) no Hoare annotation was computed. [2019-11-28 02:53:46,275 INFO L249 CegarLoopResult]: At program point L40(lines 40 57) the Hoare annotation is: true [2019-11-28 02:53:46,276 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:53:46,276 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:53:46,276 INFO L242 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~z~0) (<= ULTIMATE.start_main_~n~0 2147483647) (<= ULTIMATE.start_main_~m~0 2147483647)) [2019-11-28 02:53:46,276 INFO L246 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2019-11-28 02:53:46,276 INFO L246 CegarLoopResult]: For program point L49(lines 49 56) no Hoare annotation was computed. [2019-11-28 02:53:46,276 INFO L246 CegarLoopResult]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2019-11-28 02:53:46,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:53:46 BoogieIcfgContainer [2019-11-28 02:53:46,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:53:46,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:53:46,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:53:46,287 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:53:46,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:40" (3/4) ... [2019-11-28 02:53:46,292 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:53:46,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2019-11-28 02:53:46,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2019-11-28 02:53:46,305 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 02:53:46,305 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 02:53:46,356 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:53:46,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:53:46,359 INFO L168 Benchmark]: Toolchain (without parser) took 6322.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 957.7 MB in the beginning and 975.8 MB in the end (delta: -18.1 MB). Peak memory consumption was 198.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,363 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:53:46,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -207.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,365 INFO L168 Benchmark]: Boogie Preprocessor took 21.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,367 INFO L168 Benchmark]: RCFGBuilder took 394.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,368 INFO L168 Benchmark]: TraceAbstraction took 5497.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 146.4 MB). Peak memory consumption was 205.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,370 INFO L168 Benchmark]: Witness Printer took 70.48 ms. Allocated memory is still 1.2 GB. Free memory was 983.0 MB in the beginning and 975.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:46,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.61 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.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 89.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -207.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 394.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5497.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 146.4 MB). Peak memory consumption was 205.1 MB. Max. memory is 11.5 GB. * Witness Printer took 70.48 ms. Allocated memory is still 1.2 GB. Free memory was 983.0 MB in the beginning and 975.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: 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: 40]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 6 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 176 SDtfs, 209 SDslu, 689 SDs, 0 SdLazy, 1063 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 42 PreInvPairs, 52 NumberOfFragments, 100 HoareAnnotationTreeSize, 42 FomulaSimplifications, 91 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 31292 SizeOfPredicates, 16 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 57/73 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...