./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/genady.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/genady.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 6938b5c805400363799492c040263d9022406929 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:18:14,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:18:14,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:18:14,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:18:14,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:18:14,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:18:14,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:18:14,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:18:14,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:18:14,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:18:14,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:18:14,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:18:14,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:18:14,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:18:14,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:18:14,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:18:14,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:18:14,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:18:14,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:18:14,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:18:14,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:18:14,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:18:14,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:18:14,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:18:14,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:18:14,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:18:14,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:18:14,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:18:14,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:18:14,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:18:14,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:18:14,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:18:14,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:18:14,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:18:14,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:18:14,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:18:14,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:18:14,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:18:14,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:18:14,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:18:14,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:18:14,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-19 22:18:14,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:18:14,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:18:14,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:18:14,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:18:14,830 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:18:14,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:18:14,831 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:18:14,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:18:14,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:18:14,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:18:14,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:18:14,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:18:14,833 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 22:18:14,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:18:14,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:18:14,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:18:14,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:18:14,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:18:14,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:18:14,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:18:14,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:18:14,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:18:14,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:18:14,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:18:14,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:18:14,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:18:14,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:18:14,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6938b5c805400363799492c040263d9022406929 [2019-11-19 22:18:15,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:18:15,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:18:15,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:18:15,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:18:15,253 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:18:15,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-19 22:18:15,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839f8c7e6/33ba50459877466eb5304d844e0515ed/FLAGc7af59c51 [2019-11-19 22:18:15,797 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:18:15,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-19 22:18:15,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839f8c7e6/33ba50459877466eb5304d844e0515ed/FLAGc7af59c51 [2019-11-19 22:18:16,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839f8c7e6/33ba50459877466eb5304d844e0515ed [2019-11-19 22:18:16,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:18:16,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:18:16,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:18:16,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:18:16,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:18:16,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fed3917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16, skipping insertion in model container [2019-11-19 22:18:16,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,199 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:18:16,214 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:18:16,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:18:16,373 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:18:16,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:18:16,404 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:18:16,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16 WrapperNode [2019-11-19 22:18:16,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:18:16,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:18:16,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:18:16,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:18:16,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:18:16,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:18:16,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:18:16,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:18:16,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... [2019-11-19 22:18:16,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:18:16,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:18:16,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:18:16,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:18:16,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:18:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:18:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:18:16,740 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:18:16,740 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:18:16,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:16 BoogieIcfgContainer [2019-11-19 22:18:16,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:18:16,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:18:16,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:18:16,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:18:16,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:16" (1/3) ... [2019-11-19 22:18:16,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4802bb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:16, skipping insertion in model container [2019-11-19 22:18:16,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:16" (2/3) ... [2019-11-19 22:18:16,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4802bb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:16, skipping insertion in model container [2019-11-19 22:18:16,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:16" (3/3) ... [2019-11-19 22:18:16,750 INFO L109 eAbstractionObserver]: Analyzing ICFG genady.c [2019-11-19 22:18:16,760 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:18:16,767 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-19 22:18:16,779 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-19 22:18:16,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:18:16,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:18:16,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:18:16,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:18:16,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:18:16,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:18:16,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:18:16,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:18:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-19 22:18:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-11-19 22:18:16,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:16,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-11-19 22:18:16,837 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2019-11-19 22:18:16,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:16,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53291007] [2019-11-19 22:18:16,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53291007] [2019-11-19 22:18:17,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618743785] [2019-11-19 22:18:17,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,053 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-19 22:18:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,126 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-19 22:18:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-11-19 22:18:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,136 INFO L225 Difference]: With dead ends: 22 [2019-11-19 22:18:17,136 INFO L226 Difference]: Without dead ends: 13 [2019-11-19 22:18:17,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-19 22:18:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-19 22:18:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:18:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-19 22:18:17,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 2 [2019-11-19 22:18:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,175 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-19 22:18:17,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-19 22:18:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-19 22:18:17,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-19 22:18:17,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 30977, now seen corresponding path program 1 times [2019-11-19 22:18:17,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499907932] [2019-11-19 22:18:17,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499907932] [2019-11-19 22:18:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780497928] [2019-11-19 22:18:17,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,206 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-11-19 22:18:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,255 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-19 22:18:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-19 22:18:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,257 INFO L225 Difference]: With dead ends: 21 [2019-11-19 22:18:17,257 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 22:18:17,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 22:18:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 22:18:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:18:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-19 22:18:17,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-11-19 22:18:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,265 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-19 22:18:17,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-19 22:18:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-19 22:18:17,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-19 22:18:17,267 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29770307, now seen corresponding path program 1 times [2019-11-19 22:18:17,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026862582] [2019-11-19 22:18:17,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026862582] [2019-11-19 22:18:17,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26085418] [2019-11-19 22:18:17,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,291 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-19 22:18:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,332 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-19 22:18:17,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-19 22:18:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,333 INFO L225 Difference]: With dead ends: 19 [2019-11-19 22:18:17,334 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 22:18:17,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 22:18:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-19 22:18:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 22:18:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-19 22:18:17,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2019-11-19 22:18:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,341 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-19 22:18:17,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-19 22:18:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-19 22:18:17,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-19 22:18:17,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 922879565, now seen corresponding path program 1 times [2019-11-19 22:18:17,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359311097] [2019-11-19 22:18:17,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359311097] [2019-11-19 22:18:17,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123079990] [2019-11-19 22:18:17,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,370 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-19 22:18:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,388 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-19 22:18:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-19 22:18:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,390 INFO L225 Difference]: With dead ends: 17 [2019-11-19 22:18:17,390 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 22:18:17,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 22:18:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 22:18:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 22:18:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-19 22:18:17,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2019-11-19 22:18:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,396 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-19 22:18:17,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-19 22:18:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-19 22:18:17,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:17,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1455504507, now seen corresponding path program 1 times [2019-11-19 22:18:17,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088235037] [2019-11-19 22:18:17,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088235037] [2019-11-19 22:18:17,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199039375] [2019-11-19 22:18:17,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,446 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-11-19 22:18:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,462 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-19 22:18:17,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-19 22:18:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,464 INFO L225 Difference]: With dead ends: 16 [2019-11-19 22:18:17,464 INFO L226 Difference]: Without dead ends: 15 [2019-11-19 22:18:17,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-19 22:18:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-19 22:18:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:18:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-19 22:18:17,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2019-11-19 22:18:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,470 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-19 22:18:17,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-19 22:18:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 22:18:17,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:17,472 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2124000591, now seen corresponding path program 1 times [2019-11-19 22:18:17,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898693814] [2019-11-19 22:18:17,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898693814] [2019-11-19 22:18:17,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:18:17,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 22:18:17,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667895371] [2019-11-19 22:18:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:18:17,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:18:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,525 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-19 22:18:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,558 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-19 22:18:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:18:17,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-19 22:18:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,560 INFO L225 Difference]: With dead ends: 19 [2019-11-19 22:18:17,560 INFO L226 Difference]: Without dead ends: 18 [2019-11-19 22:18:17,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:18:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-19 22:18:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-19 22:18:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-19 22:18:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-19 22:18:17,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-11-19 22:18:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,566 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-19 22:18:17,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:18:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-19 22:18:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:18:17,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,567 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:17,568 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1055103537, now seen corresponding path program 1 times [2019-11-19 22:18:17,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:17,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484145314] [2019-11-19 22:18:17,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484145314] [2019-11-19 22:18:17,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064282193] [2019-11-19 22:18:17,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:17,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:18:17,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:17,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:17,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-19 22:18:17,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925307821] [2019-11-19 22:18:17,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:18:17,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:18:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:17,802 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-11-19 22:18:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:17,986 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-19 22:18:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:18:17,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-19 22:18:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:17,988 INFO L225 Difference]: With dead ends: 25 [2019-11-19 22:18:17,988 INFO L226 Difference]: Without dead ends: 24 [2019-11-19 22:18:17,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:18:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-19 22:18:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-19 22:18:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 22:18:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-19 22:18:17,995 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-11-19 22:18:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:17,995 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-19 22:18:17,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:18:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-19 22:18:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 22:18:17,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:17,997 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 22:18:18,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:18,199 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 342218611, now seen corresponding path program 1 times [2019-11-19 22:18:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:18,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586632252] [2019-11-19 22:18:18,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:18,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586632252] [2019-11-19 22:18:18,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45974106] [2019-11-19 22:18:18,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:18,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:18:18,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:18,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:18,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-19 22:18:18,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901866130] [2019-11-19 22:18:18,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:18,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:18,295 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-11-19 22:18:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:18,346 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-19 22:18:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:18,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 22:18:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:18,348 INFO L225 Difference]: With dead ends: 24 [2019-11-19 22:18:18,348 INFO L226 Difference]: Without dead ends: 23 [2019-11-19 22:18:18,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-19 22:18:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-19 22:18:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 22:18:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-19 22:18:18,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2019-11-19 22:18:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:18,360 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-19 22:18:18,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-19 22:18:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:18:18,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:18,361 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-19 22:18:18,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:18,566 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1217672673, now seen corresponding path program 1 times [2019-11-19 22:18:18,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:18,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90713496] [2019-11-19 22:18:18,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:18,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90713496] [2019-11-19 22:18:18,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709852689] [2019-11-19 22:18:18,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:18,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:18:18,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:18,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-19 22:18:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976274273] [2019-11-19 22:18:18,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:18:18,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:18:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:18,653 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-11-19 22:18:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:18,683 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-19 22:18:18,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:18:18,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 22:18:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:18,684 INFO L225 Difference]: With dead ends: 26 [2019-11-19 22:18:18,685 INFO L226 Difference]: Without dead ends: 25 [2019-11-19 22:18:18,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:18:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-19 22:18:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 22:18:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:18:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-19 22:18:18,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2019-11-19 22:18:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:18,690 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-19 22:18:18,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:18:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-19 22:18:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:18:18,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:18,691 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-19 22:18:18,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:18,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333055, now seen corresponding path program 2 times [2019-11-19 22:18:18,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:18,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474534325] [2019-11-19 22:18:18,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:19,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474534325] [2019-11-19 22:18:19,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402022784] [2019-11-19 22:18:19,004 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:19,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:19,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:19,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:18:19,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:19,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:19,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-11-19 22:18:19,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167488971] [2019-11-19 22:18:19,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:18:19,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:18:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:18:19,167 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-11-19 22:18:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:19,444 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-19 22:18:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:18:19,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-19 22:18:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:19,445 INFO L225 Difference]: With dead ends: 32 [2019-11-19 22:18:19,445 INFO L226 Difference]: Without dead ends: 31 [2019-11-19 22:18:19,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:18:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-19 22:18:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-19 22:18:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 22:18:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-19 22:18:19,459 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-11-19 22:18:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:19,460 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-19 22:18:19,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:18:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-19 22:18:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:18:19,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:19,461 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-11-19 22:18:19,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:19,671 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 708643907, now seen corresponding path program 2 times [2019-11-19 22:18:19,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:19,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415897812] [2019-11-19 22:18:19,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:18:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415897812] [2019-11-19 22:18:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528784580] [2019-11-19 22:18:19,739 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:19,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:19,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:19,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:18:19,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:19,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:19,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-11-19 22:18:19,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340280541] [2019-11-19 22:18:19,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:18:19,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:18:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:18:19,806 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2019-11-19 22:18:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:19,948 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-19 22:18:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:18:19,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-19 22:18:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:19,950 INFO L225 Difference]: With dead ends: 37 [2019-11-19 22:18:19,951 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 22:18:19,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:18:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 22:18:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-19 22:18:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 22:18:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-19 22:18:19,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-19 22:18:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:19,957 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-19 22:18:19,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:18:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-19 22:18:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:18:19,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:19,958 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-11-19 22:18:20,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:20,162 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1446421327, now seen corresponding path program 2 times [2019-11-19 22:18:20,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:20,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692397500] [2019-11-19 22:18:20,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:18:20,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692397500] [2019-11-19 22:18:20,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044818963] [2019-11-19 22:18:20,235 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:20,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:18:20,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:20,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:18:20,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:20,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:18:20,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-19 22:18:20,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230676644] [2019-11-19 22:18:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:18:20,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:18:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:18:20,341 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2019-11-19 22:18:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:20,499 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-19 22:18:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:18:20,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-19 22:18:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:20,501 INFO L225 Difference]: With dead ends: 26 [2019-11-19 22:18:20,501 INFO L226 Difference]: Without dead ends: 25 [2019-11-19 22:18:20,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:18:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-19 22:18:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 22:18:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 22:18:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-19 22:18:20,506 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-11-19 22:18:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:20,507 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-19 22:18:20,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:18:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-19 22:18:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:18:20,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:18:20,508 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-19 22:18:20,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:20,713 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-19 22:18:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:18:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1558507471, now seen corresponding path program 3 times [2019-11-19 22:18:20,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:18:20,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987286725] [2019-11-19 22:18:20,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:18:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:18:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:18:20,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987286725] [2019-11-19 22:18:20,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084385643] [2019-11-19 22:18:20,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:20,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 22:18:20,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:18:20,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:18:20,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:18:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 22:18:20,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:18:20,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2019-11-19 22:18:20,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673957598] [2019-11-19 22:18:20,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:18:20,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:18:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:18:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:18:20,886 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 5 states. [2019-11-19 22:18:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:18:20,917 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-19 22:18:20,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:18:20,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-19 22:18:20,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:18:20,921 INFO L225 Difference]: With dead ends: 25 [2019-11-19 22:18:20,921 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:18:20,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:18:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:18:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:18:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:18:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:18:20,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-19 22:18:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:18:20,923 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:18:20,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:18:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:18:20,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:18:21,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:18:21,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:18:21,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:21,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:18:21,260 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-19 22:18:21,261 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 22:18:21,261 INFO L440 ceAbstractionStarter]: At program point L19(lines 11 20) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)) [2019-11-19 22:18:21,261 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-19 22:18:21,261 INFO L444 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-19 22:18:21,261 INFO L444 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-19 22:18:21,261 INFO L444 ceAbstractionStarter]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L440 ceAbstractionStarter]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0))) (and (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 10001 .cse0) (<= .cse0 10001) (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)))) [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:18:21,262 INFO L444 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-19 22:18:21,263 INFO L444 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-19 22:18:21,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:21 BoogieIcfgContainer [2019-11-19 22:18:21,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:18:21,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:18:21,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:18:21,281 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:18:21,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:16" (3/4) ... [2019-11-19 22:18:21,284 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:18:21,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:18:21,295 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:18:21,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:18:21,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:18:21,336 INFO L168 Benchmark]: Toolchain (without parser) took 5154.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 956.3 MB in the beginning and 735.4 MB in the end (delta: 220.9 MB). Peak memory consumption was 278.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,337 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:18:21,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.86 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.87 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:18:21,339 INFO L168 Benchmark]: Boogie Preprocessor took 83.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -100.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,339 INFO L168 Benchmark]: RCFGBuilder took 219.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,340 INFO L168 Benchmark]: TraceAbstraction took 4536.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 742.5 MB in the end (delta: 291.6 MB). Peak memory consumption was 291.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,341 INFO L168 Benchmark]: Witness Printer took 53.73 ms. Allocated memory is still 1.1 GB. Free memory was 742.5 MB in the beginning and 735.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:18:21,345 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.86 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.87 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 57.1 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -100.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4536.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 742.5 MB in the end (delta: 291.6 MB). Peak memory consumption was 291.6 MB. Max. memory is 11.5 GB. * Witness Printer took 53.73 ms. Allocated memory is still 1.1 GB. Free memory was 742.5 MB in the beginning and 735.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((j <= i + 1 && 10001 <= i + j) && i + j <= 10001) && i <= j + 9999 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: i <= j + 9999 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 53 SDtfs, 145 SDslu, 21 SDs, 0 SdLazy, 393 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 26 HoareAnnotationTreeSize, 2 FomulaSimplifications, 70 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 15709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 64/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...