./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/EvenOdd01_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-numeric/EvenOdd01_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c954ac4f2e7268a034de9541f0b035f7b20976b7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:09:03,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:09:03,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:09:03,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:09:03,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:09:03,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:09:03,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:09:03,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:09:03,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:09:03,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:09:03,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:09:03,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:09:03,806 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:09:03,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:09:03,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:09:03,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:09:03,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:09:03,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:09:03,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:09:03,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:09:03,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:09:03,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:09:03,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:09:03,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:09:03,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:09:03,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:09:03,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:09:03,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:09:03,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:09:03,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:09:03,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:09:03,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:09:03,832 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:09:03,832 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:09:03,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:09:03,834 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:09:03,835 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-28 23:09:03,868 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:09:03,868 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:09:03,869 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 23:09:03,869 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 23:09:03,870 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:09:03,870 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:09:03,870 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:09:03,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:09:03,871 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:09:03,871 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:09:03,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:09:03,871 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 23:09:03,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 23:09:03,875 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 23:09:03,875 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-28 23:09:03,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:09:03,875 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:09:03,876 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 23:09:03,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:09:03,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:09:03,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 23:09:03,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 23:09:03,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:09:03,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:09:03,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 23:09:03,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 23:09:03,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:09:03,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 23:09:03,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 23:09:03,879 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c954ac4f2e7268a034de9541f0b035f7b20976b7 [2018-11-28 23:09:03,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:09:03,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:09:03,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:09:03,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:09:03,944 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:09:03,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/EvenOdd01_true-termination_true-no-overflow.c [2018-11-28 23:09:04,031 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9612df0a/5e00d27faac249778e4b1add8feb76f0/FLAG565f9ad1d [2018-11-28 23:09:04,519 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:09:04,520 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/EvenOdd01_true-termination_true-no-overflow.c [2018-11-28 23:09:04,529 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9612df0a/5e00d27faac249778e4b1add8feb76f0/FLAG565f9ad1d [2018-11-28 23:09:04,859 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9612df0a/5e00d27faac249778e4b1add8feb76f0 [2018-11-28 23:09:04,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:09:04,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:09:04,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:09:04,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:09:04,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:09:04,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:09:04" (1/1) ... [2018-11-28 23:09:04,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72637f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:04, skipping insertion in model container [2018-11-28 23:09:04,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:09:04" (1/1) ... [2018-11-28 23:09:04,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:09:04,908 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:09:05,089 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:09:05,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:09:05,114 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:09:05,130 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:09:05,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05 WrapperNode [2018-11-28 23:09:05,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:09:05,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:09:05,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:09:05,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:09:05,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:09:05,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:09:05,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:09:05,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:09:05,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... [2018-11-28 23:09:05,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:09:05,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:09:05,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:09:05,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:09:05,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 23:09:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 23:09:05,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 23:09:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2018-11-28 23:09:05,299 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2018-11-28 23:09:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2018-11-28 23:09:05,299 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2018-11-28 23:09:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:09:05,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:09:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 23:09:05,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 23:09:05,676 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:09:05,676 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 23:09:05,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:09:05 BoogieIcfgContainer [2018-11-28 23:09:05,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:09:05,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 23:09:05,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 23:09:05,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 23:09:05,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:09:04" (1/3) ... [2018-11-28 23:09:05,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f2eafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:09:05, skipping insertion in model container [2018-11-28 23:09:05,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:09:05" (2/3) ... [2018-11-28 23:09:05,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f2eafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:09:05, skipping insertion in model container [2018-11-28 23:09:05,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:09:05" (3/3) ... [2018-11-28 23:09:05,694 INFO L112 eAbstractionObserver]: Analyzing ICFG EvenOdd01_true-termination_true-no-overflow.c [2018-11-28 23:09:05,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 23:09:05,712 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-28 23:09:05,728 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-28 23:09:05,760 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:09:05,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 23:09:05,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 23:09:05,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 23:09:05,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:09:05,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:09:05,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 23:09:05,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:09:05,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 23:09:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-28 23:09:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 23:09:05,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:05,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:05,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:05,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1145007729, now seen corresponding path program 1 times [2018-11-28 23:09:05,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:05,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:05,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:05,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:06,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:06,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:06,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:06,022 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2018-11-28 23:09:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:06,197 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-28 23:09:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:09:06,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-28 23:09:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:06,210 INFO L225 Difference]: With dead ends: 53 [2018-11-28 23:09:06,211 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 23:09:06,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:09:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 23:09:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-28 23:09:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:09:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 23:09:06,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2018-11-28 23:09:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:06,266 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 23:09:06,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 23:09:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 23:09:06,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:06,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:06,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:06,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1135501172, now seen corresponding path program 1 times [2018-11-28 23:09:06,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:06,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:06,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:06,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:06,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:06,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:06,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:06,531 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2018-11-28 23:09:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:06,821 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-28 23:09:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:09:06,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-28 23:09:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:06,823 INFO L225 Difference]: With dead ends: 30 [2018-11-28 23:09:06,823 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 23:09:06,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:09:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 23:09:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-28 23:09:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:09:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-28 23:09:06,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2018-11-28 23:09:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:06,830 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-28 23:09:06,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-28 23:09:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 23:09:06,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:06,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:06,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:06,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1227554316, now seen corresponding path program 1 times [2018-11-28 23:09:06,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:06,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:06,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:06,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:06,911 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2018-11-28 23:09:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:07,007 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-28 23:09:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:09:07,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-28 23:09:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:07,009 INFO L225 Difference]: With dead ends: 28 [2018-11-28 23:09:07,009 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 23:09:07,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:09:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 23:09:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 23:09:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:09:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 23:09:07,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2018-11-28 23:09:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:07,016 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 23:09:07,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 23:09:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 23:09:07,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:07,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:07,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:07,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:07,019 INFO L82 PathProgramCache]: Analyzing trace with hash -600521825, now seen corresponding path program 1 times [2018-11-28 23:09:07,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:07,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:07,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:07,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:09:07,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 23:09:07,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:09:07,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:09:07,198 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-11-28 23:09:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:07,501 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-28 23:09:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:09:07,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 23:09:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:07,503 INFO L225 Difference]: With dead ends: 35 [2018-11-28 23:09:07,503 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 23:09:07,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:09:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 23:09:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-28 23:09:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:09:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-28 23:09:07,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 18 [2018-11-28 23:09:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:07,514 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-28 23:09:07,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 23:09:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-28 23:09:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 23:09:07,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:07,516 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] [2018-11-28 23:09:07,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:07,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2031952855, now seen corresponding path program 1 times [2018-11-28 23:09:07,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:09:07,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:09:07,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 23:09:07,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:09:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:09:07,583 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 5 states. [2018-11-28 23:09:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:07,695 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-28 23:09:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:09:07,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 23:09:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:07,697 INFO L225 Difference]: With dead ends: 33 [2018-11-28 23:09:07,697 INFO L226 Difference]: Without dead ends: 32 [2018-11-28 23:09:07,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:09:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-28 23:09:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 23:09:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:09:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-28 23:09:07,705 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2018-11-28 23:09:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:07,705 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-28 23:09:07,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 23:09:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-28 23:09:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 23:09:07,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:07,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:07,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:07,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1433970876, now seen corresponding path program 1 times [2018-11-28 23:09:07,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:07,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:08,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:08,159 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 [2018-11-28 23:09:08,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:08,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:08,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:08,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 23:09:08,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 23:09:08,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:09:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:09:08,244 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-11-28 23:09:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:08,478 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-28 23:09:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:09:08,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-28 23:09:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:08,480 INFO L225 Difference]: With dead ends: 40 [2018-11-28 23:09:08,480 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 23:09:08,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:09:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 23:09:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 23:09:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:09:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-28 23:09:08,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 24 [2018-11-28 23:09:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:08,489 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-28 23:09:08,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 23:09:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-28 23:09:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 23:09:08,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:08,491 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:08,491 INFO L423 AbstractCegarLoop]: === Iteration 7 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:08,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1111789655, now seen corresponding path program 1 times [2018-11-28 23:09:08,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:08,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:08,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:08,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:08,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:08,739 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 [2018-11-28 23:09:08,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:08,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:08,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:08,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 23:09:08,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 23:09:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:09:08,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:09:08,806 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-11-28 23:09:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:09,150 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-28 23:09:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:09:09,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-28 23:09:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:09,152 INFO L225 Difference]: With dead ends: 46 [2018-11-28 23:09:09,153 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 23:09:09,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:09:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 23:09:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 23:09:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 23:09:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-28 23:09:09,162 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 30 [2018-11-28 23:09:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-28 23:09:09,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 23:09:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-28 23:09:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 23:09:09,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:09,165 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:09,165 INFO L423 AbstractCegarLoop]: === Iteration 8 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:09,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2046248452, now seen corresponding path program 2 times [2018-11-28 23:09:09,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:09,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:09:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:09,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:09,551 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 [2018-11-28 23:09:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:09:09,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:09:09,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:09,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:09,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-28 23:09:09,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 23:09:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:09:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:09:09,616 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2018-11-28 23:09:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:10,218 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-28 23:09:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:09:10,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-28 23:09:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:10,221 INFO L225 Difference]: With dead ends: 52 [2018-11-28 23:09:10,222 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 23:09:10,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-11-28 23:09:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 23:09:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-28 23:09:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 23:09:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-28 23:09:10,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 36 [2018-11-28 23:09:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:10,236 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-28 23:09:10,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 23:09:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-28 23:09:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 23:09:10,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:10,241 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:10,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:10,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash -517011185, now seen corresponding path program 2 times [2018-11-28 23:09:10,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:10,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:10,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:10,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:10,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:10,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:09:10,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:09:10,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:10,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:10,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:10,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-28 23:09:10,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 23:09:10,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:09:10,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:09:10,551 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2018-11-28 23:09:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:10,929 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-28 23:09:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:09:10,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-28 23:09:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:10,930 INFO L225 Difference]: With dead ends: 58 [2018-11-28 23:09:10,931 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 23:09:10,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:09:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 23:09:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 23:09:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 23:09:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-28 23:09:10,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 42 [2018-11-28 23:09:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:10,940 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-28 23:09:10,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 23:09:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-28 23:09:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 23:09:10,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:10,942 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:10,943 INFO L423 AbstractCegarLoop]: === Iteration 10 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:10,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1095513932, now seen corresponding path program 3 times [2018-11-28 23:09:10,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:10,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:10,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:11,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:11,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:09:11,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:09:11,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:11,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:11,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:11,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-28 23:09:11,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 23:09:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 23:09:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-28 23:09:11,301 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 17 states. [2018-11-28 23:09:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:11,637 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-28 23:09:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 23:09:11,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-11-28 23:09:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:11,638 INFO L225 Difference]: With dead ends: 64 [2018-11-28 23:09:11,639 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 23:09:11,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-28 23:09:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 23:09:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-28 23:09:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 23:09:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-28 23:09:11,652 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 48 [2018-11-28 23:09:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:11,652 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-28 23:09:11,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 23:09:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-28 23:09:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 23:09:11,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:11,655 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:11,655 INFO L423 AbstractCegarLoop]: === Iteration 11 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:11,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1246899655, now seen corresponding path program 3 times [2018-11-28 23:09:11,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:11,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:12,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:12,038 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:12,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:09:12,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:09:12,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:12,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:12,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:12,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-28 23:09:12,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 23:09:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 23:09:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-11-28 23:09:12,104 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 19 states. [2018-11-28 23:09:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:12,442 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-28 23:09:12,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 23:09:12,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-28 23:09:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:12,445 INFO L225 Difference]: With dead ends: 70 [2018-11-28 23:09:12,445 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 23:09:12,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-11-28 23:09:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 23:09:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-28 23:09:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 23:09:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-28 23:09:12,456 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 54 [2018-11-28 23:09:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:12,456 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-28 23:09:12,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 23:09:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-28 23:09:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 23:09:12,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 23:09:12,460 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:09:12,460 INFO L423 AbstractCegarLoop]: === Iteration 12 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-28 23:09:12,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:09:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash -412712084, now seen corresponding path program 4 times [2018-11-28 23:09:12,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:09:12,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:09:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:12,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:09:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:09:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:09:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:09:12,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:09:12,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:09:12,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:09:12,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:09:12,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:09:12,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:09:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-28 23:09:13,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:09:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 24 [2018-11-28 23:09:13,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 23:09:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 23:09:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-11-28 23:09:13,059 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-11-28 23:09:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:09:13,229 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-28 23:09:13,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:09:13,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-11-28 23:09:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 23:09:13,231 INFO L225 Difference]: With dead ends: 68 [2018-11-28 23:09:13,231 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 23:09:13,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2018-11-28 23:09:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 23:09:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 23:09:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 23:09:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:09:13,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-11-28 23:09:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 23:09:13,236 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:09:13,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 23:09:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:09:13,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 23:09:13,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 23:09:13,498 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2018-11-28 23:09:13,769 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 12 [2018-11-28 23:09:13,777 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-28 23:09:13,778 INFO L444 ceAbstractionStarter]: At program point L32-2(line 32) the Hoare annotation is: (or (and (<= 1 isEven_~n) (<= isEven_~n 2147483647)) (< |isEven_#in~n| 1) (< 2147483647 |isEven_#in~n|)) [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-11-28 23:09:13,778 INFO L448 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 33) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L451 ceAbstractionStarter]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-28 23:09:13,781 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-28 23:09:13,782 INFO L448 ceAbstractionStarter]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-11-28 23:09:13,782 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-28 23:09:13,782 INFO L444 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (or (< 2147483647 |isOdd_#in~n|) (and (not (= isOdd_~n 0)) (<= isOdd_~n 2147483647) (<= 0 isOdd_~n) (not (= isOdd_~n 1))) (< |isOdd_#in~n| 0)) [2018-11-28 23:09:13,782 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-28 23:09:13,782 INFO L448 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-28 23:09:13,782 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 23) no Hoare annotation was computed. [2018-11-28 23:09:13,785 INFO L448 ceAbstractionStarter]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2018-11-28 23:09:13,786 INFO L451 ceAbstractionStarter]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2018-11-28 23:09:13,786 INFO L448 ceAbstractionStarter]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2018-11-28 23:09:13,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 23:09:13,786 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 23:09:13,786 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 23:09:13,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 23:09:13,787 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 37 48) the Hoare annotation is: true [2018-11-28 23:09:13,788 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 37 48) no Hoare annotation was computed. [2018-11-28 23:09:13,789 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-28 23:09:13,789 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 37 48) no Hoare annotation was computed. [2018-11-28 23:09:13,789 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-28 23:09:13,789 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~n~0) (<= main_~n~0 2147483647)) [2018-11-28 23:09:13,789 INFO L448 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. [2018-11-28 23:09:13,789 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. [2018-11-28 23:09:13,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:09:13 BoogieIcfgContainer [2018-11-28 23:09:13,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 23:09:13,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:09:13,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:09:13,796 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:09:13,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:09:05" (3/4) ... [2018-11-28 23:09:13,802 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 23:09:13,812 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 23:09:13,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2018-11-28 23:09:13,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2018-11-28 23:09:13,813 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 23:09:13,820 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-28 23:09:13,820 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 23:09:13,821 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 23:09:13,880 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:09:13,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:09:13,881 INFO L168 Benchmark]: Toolchain (without parser) took 9017.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 952.7 MB in the beginning and 926.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 221.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:13,883 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:13,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:13,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:13,885 INFO L168 Benchmark]: Boogie Preprocessor took 18.85 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:13,885 INFO L168 Benchmark]: RCFGBuilder took 510.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:13,887 INFO L168 Benchmark]: TraceAbstraction took 8111.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 926.1 MB in the end (delta: 173.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:09:13,888 INFO L168 Benchmark]: Witness Printer took 84.73 ms. Allocated memory is still 1.2 GB. Free memory is still 926.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:09:13,893 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.17 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 265.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.94 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.85 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 510.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8111.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 926.1 MB in the end (delta: 173.3 MB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. * Witness Printer took 84.73 ms. Allocated memory is still 1.2 GB. Free memory is still 926.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: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 4 error locations. SAFE Result, 8.0s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 296 SDslu, 1035 SDs, 0 SdLazy, 991 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 11 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 25 NumberOfFragments, 53 HoareAnnotationTreeSize, 25 FomulaSimplifications, 824 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 666 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 112776 SizeOfPredicates, 42 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 84/572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...