./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-numeric/TwoWay_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-numeric/TwoWay_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dd635190a9aa277670265f46b90ecce0c321a2a9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:58:56,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:58:56,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:58:56,495 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:58:56,495 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:58:56,496 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:58:56,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:58:56,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:58:56,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:58:56,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:58:56,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:58:56,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:58:56,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:58:56,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:58:56,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:58:56,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:58:56,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:58:56,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:58:56,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:58:56,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:58:56,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:58:56,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:58:56,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:58:56,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:58:56,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:58:56,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:58:56,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:58:56,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:58:56,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:58:56,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:58:56,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:58:56,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:58:56,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:58:56,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:58:56,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:58:56,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:58:56,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:58:56,555 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:58:56,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:58:56,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:58:56,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:58:56,557 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:58:56,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:58:56,558 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:58:56,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:58:56,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:58:56,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:58:56,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:58:56,560 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:58:56,560 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:58:56,560 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:58:56,560 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:58:56,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:58:56,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:58:56,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:58:56,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:58:56,561 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:58:56,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:58:56,563 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:58:56,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:58:56,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:58:56,564 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:58:56,564 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:58:56,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:58:56,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd635190a9aa277670265f46b90ecce0c321a2a9 [2019-01-01 20:58:56,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:58:56,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:58:56,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:58:56,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:58:56,639 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:58:56,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-numeric/TwoWay_true-termination_true-no-overflow.c [2019-01-01 20:58:56,713 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b16ca988/2f40db1c45f34e80927426d42f74df44/FLAG3977ed135 [2019-01-01 20:58:57,125 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:58:57,126 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-numeric/TwoWay_true-termination_true-no-overflow.c [2019-01-01 20:58:57,133 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b16ca988/2f40db1c45f34e80927426d42f74df44/FLAG3977ed135 [2019-01-01 20:58:57,499 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b16ca988/2f40db1c45f34e80927426d42f74df44 [2019-01-01 20:58:57,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:58:57,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:58:57,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:58:57,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:58:57,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:58:57,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c285e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57, skipping insertion in model container [2019-01-01 20:58:57,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:58:57,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:58:57,796 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:58:57,803 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:58:57,831 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:58:57,850 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:58:57,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57 WrapperNode [2019-01-01 20:58:57,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:58:57,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:58:57,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:58:57,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:58:57,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:58:57,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:58:57,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:58:57,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:58:57,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... [2019-01-01 20:58:57,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:58:57,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:58:57,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:58:57,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:58:57,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:58:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure twoWay [2019-01-01 20:58:58,081 INFO L138 BoogieDeclarations]: Found implementation of procedure twoWay [2019-01-01 20:58:58,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:58:58,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:58:58,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:58:58,591 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:58:58,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:58:58 BoogieIcfgContainer [2019-01-01 20:58:58,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:58:58,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:58:58,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:58:58,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:58:58,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:58:57" (1/3) ... [2019-01-01 20:58:58,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad5b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:58:58, skipping insertion in model container [2019-01-01 20:58:58,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:58:57" (2/3) ... [2019-01-01 20:58:58,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad5b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:58:58, skipping insertion in model container [2019-01-01 20:58:58,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:58:58" (3/3) ... [2019-01-01 20:58:58,603 INFO L112 eAbstractionObserver]: Analyzing ICFG TwoWay_true-termination_true-no-overflow.c [2019-01-01 20:58:58,616 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:58:58,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 20:58:58,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 20:58:58,685 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:58:58,686 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:58:58,686 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:58:58,686 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:58:58,687 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:58:58,687 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:58:58,687 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:58:58,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:58:58,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:58:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-01 20:58:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:58:58,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:58:58,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:58:58,722 INFO L423 AbstractCegarLoop]: === Iteration 1 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:58:58,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:58:58,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1734939443, now seen corresponding path program 1 times [2019-01-01 20:58:58,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:58:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:58:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:58:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:58:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:58:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:58:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:58:59,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:58:59,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:58:59,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:58:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:58:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:58:59,096 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 7 states. [2019-01-01 20:58:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:58:59,785 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-01-01 20:58:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:58:59,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-01 20:58:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:58:59,800 INFO L225 Difference]: With dead ends: 56 [2019-01-01 20:58:59,800 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 20:58:59,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:58:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 20:58:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2019-01-01 20:58:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 20:58:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-01-01 20:58:59,861 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 8 [2019-01-01 20:58:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:58:59,861 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 20:58:59,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:58:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-01-01 20:58:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:58:59,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:58:59,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:58:59,863 INFO L423 AbstractCegarLoop]: === Iteration 2 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:58:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:58:59,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1734939635, now seen corresponding path program 1 times [2019-01-01 20:58:59,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:58:59,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:58:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:58:59,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:58:59,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:58:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:58:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:58:59,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:58:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:58:59,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:58:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:58:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:58:59,995 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 4 states. [2019-01-01 20:59:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:00,063 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2019-01-01 20:59:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:59:00,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-01 20:59:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:00,069 INFO L225 Difference]: With dead ends: 45 [2019-01-01 20:59:00,069 INFO L226 Difference]: Without dead ends: 18 [2019-01-01 20:59:00,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:59:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-01 20:59:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 20:59:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 20:59:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-01-01 20:59:00,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2019-01-01 20:59:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:00,084 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-01-01 20:59:00,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:59:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-01-01 20:59:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:59:00,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:00,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:00,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2051452074, now seen corresponding path program 1 times [2019-01-01 20:59:00,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:00,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:00,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-01-01 20:59:00,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:59:00,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:59:00,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:59:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:59:00,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:59:00,370 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-01-01 20:59:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:00,572 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-01-01 20:59:00,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:59:00,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-01 20:59:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:00,575 INFO L225 Difference]: With dead ends: 35 [2019-01-01 20:59:00,576 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 20:59:00,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:59:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 20:59:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-01 20:59:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 20:59:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-01 20:59:00,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2019-01-01 20:59:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:00,586 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-01 20:59:00,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:59:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-01 20:59:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:59:00,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:00,588 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:00,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2048642091, now seen corresponding path program 1 times [2019-01-01 20:59:00,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:00,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:00,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:00,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:00,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:00,604 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:00,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:00,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:00,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:59:01,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:01,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-01 20:59:01,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:59:01,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:59:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:59:01,193 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 10 states. [2019-01-01 20:59:01,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:01,606 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-01-01 20:59:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:59:01,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-01 20:59:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:01,609 INFO L225 Difference]: With dead ends: 36 [2019-01-01 20:59:01,609 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 20:59:01,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:59:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 20:59:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-01 20:59:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 20:59:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-01-01 20:59:01,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2019-01-01 20:59:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:01,619 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-01-01 20:59:01,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:59:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-01-01 20:59:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:59:01,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:01,620 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:01,622 INFO L423 AbstractCegarLoop]: === Iteration 5 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash -916604565, now seen corresponding path program 1 times [2019-01-01 20:59:01,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:01,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:01,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:01,635 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:01,635 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:01,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:01,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:01,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:59:01,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:01,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-01 20:59:01,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:59:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:59:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:59:01,844 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2019-01-01 20:59:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:02,309 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-01-01 20:59:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 20:59:02,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-01-01 20:59:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:02,312 INFO L225 Difference]: With dead ends: 37 [2019-01-01 20:59:02,312 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 20:59:02,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:59:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 20:59:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-01 20:59:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 20:59:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-01-01 20:59:02,321 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 17 [2019-01-01 20:59:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:02,322 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-01-01 20:59:02,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:59:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-01-01 20:59:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:59:02,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:02,324 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:02,324 INFO L423 AbstractCegarLoop]: === Iteration 6 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash 37921722, now seen corresponding path program 1 times [2019-01-01 20:59:02,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:02,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:02,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:02,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:02,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:02,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:02,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 20:59:02,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:02,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-01-01 20:59:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:59:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:59:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:59:02,650 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 11 states. [2019-01-01 20:59:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:03,087 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-01 20:59:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:59:03,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-01-01 20:59:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:03,091 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:59:03,091 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 20:59:03,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:59:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 20:59:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-01 20:59:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 20:59:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-01 20:59:03,102 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2019-01-01 20:59:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:03,102 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-01 20:59:03,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:59:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-01 20:59:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:59:03,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:03,105 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:03,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1175573436, now seen corresponding path program 1 times [2019-01-01 20:59:03,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:03,124 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:03,124 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:03,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:03,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:59:03,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:59:03,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:03,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-01-01 20:59:03,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:59:03,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:59:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:59:03,478 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 16 states. [2019-01-01 20:59:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:04,323 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-01 20:59:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:59:04,324 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-01-01 20:59:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:04,325 INFO L225 Difference]: With dead ends: 40 [2019-01-01 20:59:04,326 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:59:04,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:59:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:59:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-01 20:59:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 20:59:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-01-01 20:59:04,335 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2019-01-01 20:59:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:04,335 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-01-01 20:59:04,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:59:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-01-01 20:59:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 20:59:04,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:04,337 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:04,337 INFO L423 AbstractCegarLoop]: === Iteration 8 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1895922327, now seen corresponding path program 2 times [2019-01-01 20:59:04,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:04,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:59:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:04,353 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:04,353 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:04,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:59:04,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:59:04,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:04,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 20:59:04,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:04,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-01-01 20:59:04,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:59:04,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:59:04,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:59:04,835 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 21 states. [2019-01-01 20:59:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:05,630 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-01-01 20:59:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:59:05,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-01-01 20:59:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:05,634 INFO L225 Difference]: With dead ends: 48 [2019-01-01 20:59:05,635 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 20:59:05,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-01-01 20:59:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 20:59:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2019-01-01 20:59:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 20:59:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-01 20:59:05,646 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 38 [2019-01-01 20:59:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:05,647 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-01 20:59:05,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:59:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-01 20:59:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 20:59:05,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:05,650 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:05,651 INFO L423 AbstractCegarLoop]: === Iteration 9 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash 119307955, now seen corresponding path program 2 times [2019-01-01 20:59:05,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:05,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:05,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:05,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:05,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:05,669 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:05,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:05,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:59:05,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:59:05,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:05,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 20:59:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-01-01 20:59:06,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-01 20:59:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 20:59:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:59:06,060 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 15 states. [2019-01-01 20:59:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:06,487 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-01-01 20:59:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:59:06,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-01-01 20:59:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:06,490 INFO L225 Difference]: With dead ends: 47 [2019-01-01 20:59:06,491 INFO L226 Difference]: Without dead ends: 43 [2019-01-01 20:59:06,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:59:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-01 20:59:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-01-01 20:59:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 20:59:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-01-01 20:59:06,499 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 51 [2019-01-01 20:59:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:06,499 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-01-01 20:59:06,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-01 20:59:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-01-01 20:59:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 20:59:06,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:59:06,503 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-01 20:59:06,504 INFO L423 AbstractCegarLoop]: === Iteration 10 === [twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:59:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:59:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1378436786, now seen corresponding path program 3 times [2019-01-01 20:59:06,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:59:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:59:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:06,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:59:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:59:06,519 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 20:59:06,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 20:59:06,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-01 20:59:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:59:08,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:59:08,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:59:08,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:59:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-01 20:59:08,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:59:08,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-01-01 20:59:08,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:59:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:59:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:59:08,735 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 13 states. [2019-01-01 20:59:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:59:09,290 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2019-01-01 20:59:09,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:59:09,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-01-01 20:59:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:59:09,292 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:59:09,292 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:59:09,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:59:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:59:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:59:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:59:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:59:09,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-01-01 20:59:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:59:09,295 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:59:09,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:59:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:59:09,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:59:09,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:59:09,442 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2019-01-01 20:59:09,442 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 35) the Hoare annotation is: (or (< 2147483647 |twoWay_#in~n|) (and (<= |twoWay_#in~n| twoWay_~n) (<= 1 twoWay_~terminate) (= |twoWay_#in~n| (+ twoWay_~m~0 1)) (<= 0 twoWay_~n) (<= twoWay_~n |twoWay_#in~n|)) (< |twoWay_#in~terminate| 1)) [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 37) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point twoWayErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point twoWayFINAL(lines 26 38) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point twoWayErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point twoWayErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2019-01-01 20:59:09,443 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point L36-2(line 36) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L451 ceAbstractionStarter]: At program point twoWayENTRY(lines 26 38) the Hoare annotation is: true [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point twoWayErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point twoWayErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-01-01 20:59:09,444 INFO L448 ceAbstractionStarter]: For program point twoWayEXIT(lines 26 38) no Hoare annotation was computed. [2019-01-01 20:59:09,445 INFO L448 ceAbstractionStarter]: For program point twoWayErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2019-01-01 20:59:09,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:59:09,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:59:09,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:59:09,445 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-01-01 20:59:09,445 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2019-01-01 20:59:09,446 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-01-01 20:59:09,446 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-01-01 20:59:09,446 INFO L444 ceAbstractionStarter]: At program point L40(lines 40 50) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:59:09,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:59:09 BoogieIcfgContainer [2019-01-01 20:59:09,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:59:09,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:59:09,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:59:09,461 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:59:09,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:58:58" (3/4) ... [2019-01-01 20:59:09,465 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:59:09,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure twoWay [2019-01-01 20:59:09,477 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-01 20:59:09,477 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:59:09,538 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:59:09,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:59:09,539 INFO L168 Benchmark]: Toolchain (without parser) took 12036.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 946.0 MB in the beginning and 885.7 MB in the end (delta: 60.3 MB). Peak memory consumption was 245.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:59:09,542 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:59:09,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.33 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:59:09,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.23 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:59:09,546 INFO L168 Benchmark]: Boogie Preprocessor took 25.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:59:09,548 INFO L168 Benchmark]: RCFGBuilder took 671.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 20:59:09,549 INFO L168 Benchmark]: TraceAbstraction took 10866.63 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 885.7 MB in the end (delta: 201.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 GB. [2019-01-01 20:59:09,549 INFO L168 Benchmark]: Witness Printer took 77.54 ms. Allocated memory is still 1.2 GB. Free memory was 885.7 MB in the beginning and 885.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 20:59:09,557 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.33 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 42.23 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.61 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 671.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10866.63 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 885.7 MB in the end (delta: 201.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 GB. * Witness Printer took 77.54 ms. Allocated memory is still 1.2 GB. Free memory was 885.7 MB in the beginning and 885.7 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 6 error locations. SAFE Result, 10.7s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 613 SDslu, 571 SDs, 0 SdLazy, 1086 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 38 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 251 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 241 ConstructedInterpolants, 9 QuantifiedInterpolants, 43978 SizeOfPredicates, 40 NumberOfNonLiveVariables, 669 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 126/226 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...