./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ba31a8852254650e4ff6b6614669c496c01110f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:56:14,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:56:14,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:56:14,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:56:14,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:56:14,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:56:14,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:56:14,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:56:14,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:56:14,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:56:14,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:56:14,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:56:14,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:56:14,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:56:14,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:56:14,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:56:14,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:56:14,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:56:14,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:56:14,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:56:14,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:56:14,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:56:14,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:56:14,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:56:14,709 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:56:14,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:56:14,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:56:14,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:56:14,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:56:14,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:56:14,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:56:14,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:56:14,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:56:14,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:56:14,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:56:14,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:56:14,717 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:56:14,735 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:56:14,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:56:14,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:56:14,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:56:14,736 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:56:14,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:56:14,737 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:56:14,737 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:56:14,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:56:14,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:56:14,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:56:14,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:56:14,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:56:14,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:56:14,739 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:56:14,740 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:56:14,740 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:56:14,740 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:56:14,741 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:56:14,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:56:14,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:56:14,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:56:14,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:56:14,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:56:14,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:56:14,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ba31a8852254650e4ff6b6614669c496c01110f [2019-01-14 01:56:14,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:56:14,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:56:14,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:56:14,820 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:56:14,820 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:56:14,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:14,881 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b38c6bcf/074645b164e341efa13863391ec0d15f/FLAG96ee017cb [2019-01-14 01:56:15,280 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:56:15,281 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:15,286 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b38c6bcf/074645b164e341efa13863391ec0d15f/FLAG96ee017cb [2019-01-14 01:56:15,669 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b38c6bcf/074645b164e341efa13863391ec0d15f [2019-01-14 01:56:15,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:56:15,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:56:15,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:56:15,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:56:15,681 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:56:15,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:15,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15, skipping insertion in model container [2019-01-14 01:56:15,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:15,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:56:15,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:56:15,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:56:15,939 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:56:15,970 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:56:15,988 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:56:15,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15 WrapperNode [2019-01-14 01:56:15,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:56:15,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:56:15,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:56:15,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:56:16,001 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:56:15" (1/1) ... [2019-01-14 01:56:16,008 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:56:15" (1/1) ... [2019-01-14 01:56:16,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:56:16,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:56:16,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:56:16,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:56:16,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (1/1) ... [2019-01-14 01:56:16,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:56:16,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:56:16,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:56:16,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:56:16,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (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:56:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2019-01-14 01:56:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2019-01-14 01:56:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2019-01-14 01:56:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2019-01-14 01:56:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:56:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:56:16,695 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:56:16,695 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:56:16,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:56:16 BoogieIcfgContainer [2019-01-14 01:56:16,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:56:16,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:56:16,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:56:16,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:56:16,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:56:15" (1/3) ... [2019-01-14 01:56:16,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ff2f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:56:16, skipping insertion in model container [2019-01-14 01:56:16,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:15" (2/3) ... [2019-01-14 01:56:16,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ff2f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:56:16, skipping insertion in model container [2019-01-14 01:56:16,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:56:16" (3/3) ... [2019-01-14 01:56:16,707 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:16,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:56:16,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:56:16,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:56:16,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:56:16,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:56:16,775 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:56:16,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:56:16,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:56:16,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:56:16,776 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:56:16,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:56:16,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:56:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-01-14 01:56:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:56:16,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:16,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:16,808 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:16,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1549577429, now seen corresponding path program 1 times [2019-01-14 01:56:16,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:16,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:16,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:17,018 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:56:17,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:17,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:56:17,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:56:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:56:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:17,041 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2019-01-14 01:56:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:17,526 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2019-01-14 01:56:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:56:17,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-14 01:56:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:17,536 INFO L225 Difference]: With dead ends: 82 [2019-01-14 01:56:17,536 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 01:56:17,540 INFO L631 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-01-14 01:56:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 01:56:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 01:56:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:56:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 01:56:17,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 10 [2019-01-14 01:56:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:17,581 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 01:56:17,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:56:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-14 01:56:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:56:17,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:17,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:17,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1549577653, now seen corresponding path program 1 times [2019-01-14 01:56:17,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:17,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:17,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:17,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:17,662 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:56:17,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:17,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 01:56:17,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:56:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:56:17,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:17,666 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-01-14 01:56:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:17,924 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-14 01:56:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:56:17,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-14 01:56:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:17,926 INFO L225 Difference]: With dead ends: 31 [2019-01-14 01:56:17,926 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 01:56:17,927 INFO L631 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-01-14 01:56:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 01:56:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 01:56:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:56:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-01-14 01:56:17,935 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2019-01-14 01:56:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:17,936 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-01-14 01:56:17,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:56:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-01-14 01:56:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:56:17,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:17,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:17,938 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash -670047346, now seen corresponding path program 1 times [2019-01-14 01:56:17,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:17,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:18,086 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:56:18,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:18,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 01:56:18,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:56:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:56:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:56:18,088 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 8 states. [2019-01-14 01:56:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:18,656 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-01-14 01:56:18,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:56:18,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-14 01:56:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:18,662 INFO L225 Difference]: With dead ends: 41 [2019-01-14 01:56:18,662 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 01:56:18,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:56:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 01:56:18,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 01:56:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 01:56:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2019-01-14 01:56:18,682 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 16 [2019-01-14 01:56:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:18,683 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2019-01-14 01:56:18,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:56:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2019-01-14 01:56:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:56:18,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:18,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:18,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 703368796, now seen corresponding path program 1 times [2019-01-14 01:56:18,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:18,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:18,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:18,732 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:56:18,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:18,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:56:18,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:56:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:56:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:56:18,734 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 3 states. [2019-01-14 01:56:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:18,757 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-14 01:56:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:56:18,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 01:56:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:18,760 INFO L225 Difference]: With dead ends: 37 [2019-01-14 01:56:18,760 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:56:18,761 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:56:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:56:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 01:56:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 01:56:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-01-14 01:56:18,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2019-01-14 01:56:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:18,770 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-01-14 01:56:18,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:56:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-01-14 01:56:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:56:18,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:18,772 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:18,773 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 481959190, now seen corresponding path program 1 times [2019-01-14 01:56:18,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:18,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:18,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:56:18,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:18,985 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:56:18,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:19,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:56:19,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:56:19,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2019-01-14 01:56:19,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:56:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:56:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:56:19,442 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 20 states. [2019-01-14 01:56:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:20,339 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-14 01:56:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 01:56:20,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-01-14 01:56:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:20,342 INFO L225 Difference]: With dead ends: 48 [2019-01-14 01:56:20,343 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 01:56:20,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:56:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 01:56:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 01:56:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:56:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 01:56:20,351 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2019-01-14 01:56:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:20,352 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 01:56:20,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:56:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 01:56:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:56:20,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:20,353 INFO L402 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-01-14 01:56:20,354 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 817476587, now seen corresponding path program 1 times [2019-01-14 01:56:20,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 01:56:20,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:20,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 01:56:20,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:56:20,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:56:20,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:56:20,532 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 9 states. [2019-01-14 01:56:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:21,112 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-01-14 01:56:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:56:21,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-14 01:56:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:21,115 INFO L225 Difference]: With dead ends: 42 [2019-01-14 01:56:21,115 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 01:56:21,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:56:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 01:56:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 01:56:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 01:56:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-01-14 01:56:21,123 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2019-01-14 01:56:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:21,123 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-01-14 01:56:21,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:56:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-01-14 01:56:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:56:21,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:21,125 INFO L402 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-01-14 01:56:21,125 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash -957242837, now seen corresponding path program 1 times [2019-01-14 01:56:21,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:21,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:21,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 01:56:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:21,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 01:56:21,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:56:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:56:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:56:21,273 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 10 states. [2019-01-14 01:56:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:21,540 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-01-14 01:56:21,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:56:21,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-14 01:56:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:21,542 INFO L225 Difference]: With dead ends: 51 [2019-01-14 01:56:21,542 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 01:56:21,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:56:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 01:56:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-01-14 01:56:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:56:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-01-14 01:56:21,552 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 26 [2019-01-14 01:56:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:21,553 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-01-14 01:56:21,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:56:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-01-14 01:56:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:56:21,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:21,556 INFO L402 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-01-14 01:56:21,557 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -630492237, now seen corresponding path program 1 times [2019-01-14 01:56:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:21,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:21,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 01:56:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:21,832 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:56:21,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:21,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 01:56:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:56:22,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2019-01-14 01:56:22,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 01:56:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 01:56:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:56:22,212 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 22 states. [2019-01-14 01:56:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:23,205 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-01-14 01:56:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:56:23,206 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-01-14 01:56:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:23,208 INFO L225 Difference]: With dead ends: 60 [2019-01-14 01:56:23,208 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 01:56:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:56:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 01:56:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 01:56:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:56:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-01-14 01:56:23,219 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 32 [2019-01-14 01:56:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:23,219 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-01-14 01:56:23,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 01:56:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-01-14 01:56:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:56:23,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:23,221 INFO L402 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-01-14 01:56:23,221 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1826368274, now seen corresponding path program 1 times [2019-01-14 01:56:23,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 01:56:23,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:23,425 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:56:23,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:23,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-14 01:56:23,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:56:23,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 19 [2019-01-14 01:56:23,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:56:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:56:23,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:56:23,649 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 20 states. [2019-01-14 01:56:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:24,110 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-01-14 01:56:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 01:56:24,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-01-14 01:56:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:24,112 INFO L225 Difference]: With dead ends: 44 [2019-01-14 01:56:24,112 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:56:24,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:56:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:56:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:56:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:56:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:56:24,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-01-14 01:56:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:24,116 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:56:24,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:56:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:56:24,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:56:24,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:56:24,555 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-01-14 01:56:24,742 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-14 01:56:24,809 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2019-01-14 01:56:24,809 INFO L448 ceAbstractionStarter]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2019-01-14 01:56:24,809 INFO L448 ceAbstractionStarter]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2019-01-14 01:56:24,809 INFO L448 ceAbstractionStarter]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2019-01-14 01:56:24,809 INFO L448 ceAbstractionStarter]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2019-01-14 01:56:24,810 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-14 01:56:24,810 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-01-14 01:56:24,810 INFO L451 ceAbstractionStarter]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2019-01-14 01:56:24,810 INFO L444 ceAbstractionStarter]: At program point L37-2(line 37) the Hoare annotation is: (let ((.cse0 (< |divides_#in~n| 1)) (.cse1 (+ |divides_#in~m| 1)) (.cse2 (< 2147483647 |divides_#in~m|))) (and (or (< 2147483646 |divides_#in~m|) .cse0 (< |divides_#in~n| .cse1)) (or .cse0 (and (<= divides_~m 2147483647) (<= divides_~n divides_~m) (<= 1 divides_~n)) .cse2) (or .cse0 (<= (+ divides_~m 1) (* 2 divides_~n)) (< (* 2 |divides_#in~n|) .cse1) .cse2))) [2019-01-14 01:56:24,810 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:56:24,811 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-14 01:56:24,812 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:56:24,812 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 01:56:24,812 INFO L444 ceAbstractionStarter]: At program point L26-2(line 26) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y1 |gcd_#in~y2|) (<= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2019-01-14 01:56:24,812 INFO L451 ceAbstractionStarter]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2019-01-14 01:56:24,812 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-14 01:56:24,812 INFO L448 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2019-01-14 01:56:24,812 INFO L444 ceAbstractionStarter]: At program point L24-2(line 24) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2019-01-14 01:56:24,812 INFO L448 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L444 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= ULTIMATE.start_main_~m~0 2147483647) (<= 1 ULTIMATE.start_main_~m~0)) [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2019-01-14 01:56:24,813 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 44) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L451 ceAbstractionStarter]: At program point L40(lines 40 57) the Hoare annotation is: true [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L444 ceAbstractionStarter]: 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) (<= 1 ULTIMATE.start_main_~m~0)) [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 56) no Hoare annotation was computed. [2019-01-14 01:56:24,814 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2019-01-14 01:56:24,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:56:24 BoogieIcfgContainer [2019-01-14 01:56:24,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:56:24,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:56:24,822 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:56:24,822 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:56:24,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:56:16" (3/4) ... [2019-01-14 01:56:24,827 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:56:24,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2019-01-14 01:56:24,833 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2019-01-14 01:56:24,839 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 01:56:24,839 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 01:56:24,909 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:56:24,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:56:24,910 INFO L168 Benchmark]: Toolchain (without parser) took 9235.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 952.7 MB in the beginning and 923.1 MB in the end (delta: 29.6 MB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:56:24,911 INFO L168 Benchmark]: CDTParser took 0.14 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:56:24,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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:56:24,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:56:24,912 INFO L168 Benchmark]: Boogie Preprocessor took 35.52 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:56:24,913 INFO L168 Benchmark]: RCFGBuilder took 629.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:56:24,913 INFO L168 Benchmark]: TraceAbstraction took 8123.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 923.1 MB in the end (delta: 178.8 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2019-01-14 01:56:24,914 INFO L168 Benchmark]: Witness Printer took 87.18 ms. Allocated memory is still 1.2 GB. Free memory is still 923.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:56:24,917 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.14 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 312.31 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.52 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 629.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8123.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 923.1 MB in the end (delta: 178.8 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. * Witness Printer took 87.18 ms. Allocated memory is still 1.2 GB. Free memory is still 923.1 MB. There was no memory consumed. 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: 24]: 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: 26]: 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. SAFE Result, 8.0s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 253 SDslu, 739 SDs, 0 SdLazy, 1761 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 3.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 40 PreInvPairs, 52 NumberOfFragments, 136 HoareAnnotationTreeSize, 40 FomulaSimplifications, 225 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 187 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 24621 SizeOfPredicates, 13 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 51/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...