java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:52:26,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:52:26,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:52:26,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:52:26,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:52:26,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:52:26,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:52:26,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:52:26,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:52:26,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:52:26,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:52:26,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:52:26,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:52:26,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:52:26,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:52:26,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:52:26,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:52:26,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:52:26,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:52:26,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:52:26,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:52:26,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:52:26,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:52:26,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:52:26,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:52:26,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:52:26,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:52:26,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:52:26,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:52:26,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:52:26,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:52:26,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:52:26,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:52:26,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:52:26,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:52:26,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:52:26,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:52:26,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:52:26,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:52:26,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:52:26,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:52:26,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:52:26,822 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:52:26,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:52:26,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:52:26,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:52:26,825 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:52:26,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:52:26,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:52:26,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:52:26,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:52:26,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:52:26,827 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:52:26,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:52:26,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:52:26,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:52:26,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:52:26,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:52:26,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:52:26,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:52:26,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:52:26,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:52:26,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:52:26,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:52:26,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:52:26,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:52:26,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:52:26,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:52:26,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:52:26,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:52:26,885 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:52:26,885 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-08 02:52:26,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c9c8ea7/9b8708f963914366b2af1ec29dd40d18/FLAGb43edf2b7 [2019-09-08 02:52:27,415 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:52:27,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-08 02:52:27,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c9c8ea7/9b8708f963914366b2af1ec29dd40d18/FLAGb43edf2b7 [2019-09-08 02:52:27,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c9c8ea7/9b8708f963914366b2af1ec29dd40d18 [2019-09-08 02:52:27,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:52:27,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:52:27,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:52:27,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:52:27,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:52:27,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:27" (1/1) ... [2019-09-08 02:52:27,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:27, skipping insertion in model container [2019-09-08 02:52:27,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:52:27" (1/1) ... [2019-09-08 02:52:27,871 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:52:27,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:52:28,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:52:28,100 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:52:28,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:52:28,245 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:52:28,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28 WrapperNode [2019-09-08 02:52:28,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:52:28,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:52:28,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:52:28,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:52:28,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (1/1) ... [2019-09-08 02:52:28,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:52:28,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:52:28,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:52:28,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:52:28,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (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-09-08 02:52:28,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:52:28,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:52:28,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 02:52:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:52:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:52:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:52:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:52:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:52:28,648 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:52:28,648 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 02:52:28,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:28 BoogieIcfgContainer [2019-09-08 02:52:28,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:52:28,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:52:28,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:52:28,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:52:28,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:52:27" (1/3) ... [2019-09-08 02:52:28,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e33b764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:28, skipping insertion in model container [2019-09-08 02:52:28,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:52:28" (2/3) ... [2019-09-08 02:52:28,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e33b764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:52:28, skipping insertion in model container [2019-09-08 02:52:28,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:52:28" (3/3) ... [2019-09-08 02:52:28,657 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-08 02:52:28,668 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:52:28,675 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 02:52:28,709 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 02:52:28,749 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:52:28,750 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:52:28,750 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:52:28,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:52:28,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:52:28,750 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:52:28,750 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:52:28,751 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:52:28,751 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:52:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-08 02:52:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:52:28,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:28,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:28,777 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-08 02:52:28,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:28,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:28,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:28,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:28,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:52:28,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:52:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:52:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:52:28,999 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-08 02:52:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:29,038 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-09-08 02:52:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:52:29,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-08 02:52:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:29,049 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:52:29,050 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 02:52:29,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 02:52:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 02:52:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-08 02:52:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:52:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-08 02:52:29,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-08 02:52:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:29,092 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-08 02:52:29,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:52:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-08 02:52:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:52:29,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:29,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:29,095 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:29,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-08 02:52:29,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:29,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:29,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:52:29,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:52:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:52:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:52:29,182 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-08 02:52:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:29,232 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-09-08 02:52:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:52:29,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 02:52:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:29,236 INFO L225 Difference]: With dead ends: 53 [2019-09-08 02:52:29,236 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 02:52:29,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:52:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 02:52:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-08 02:52:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:52:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-08 02:52:29,245 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-08 02:52:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:29,245 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-08 02:52:29,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:52:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-08 02:52:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:52:29,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:29,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:29,247 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-08 02:52:29,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:29,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:29,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:29,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:52:29,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:52:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:52:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:52:29,317 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-08 02:52:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:29,367 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-09-08 02:52:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:52:29,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-08 02:52:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:29,369 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:52:29,369 INFO L226 Difference]: Without dead ends: 41 [2019-09-08 02:52:29,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 02:52:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-08 02:52:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-08 02:52:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:52:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-08 02:52:29,380 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-08 02:52:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:29,380 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-08 02:52:29,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:52:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-08 02:52:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:52:29,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:29,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:29,384 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-08 02:52:29,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:29,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-09-08 02:52:29,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:29,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:52:29,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:52:29,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:52:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:52:29,444 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-08 02:52:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:29,495 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-08 02:52:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:52:29,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-08 02:52:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:29,497 INFO L225 Difference]: With dead ends: 56 [2019-09-08 02:52:29,497 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:52:29,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 02:52:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:52:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-08 02:52:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 02:52:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-08 02:52:29,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-08 02:52:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:29,503 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-08 02:52:29,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:52:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-08 02:52:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:52:29,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:29,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:29,505 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:29,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-08 02:52:29,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:29,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:29,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:29,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:30,039 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2019-09-08 02:52:30,331 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 40 [2019-09-08 02:52:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:30,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:30,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 02:52:30,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:52:30,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:52:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:52:30,419 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-09-08 02:52:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:30,735 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-08 02:52:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 02:52:30,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-08 02:52:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:30,740 INFO L225 Difference]: With dead ends: 47 [2019-09-08 02:52:30,740 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 02:52:30,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:52:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 02:52:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-08 02:52:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:52:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-08 02:52:30,751 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-08 02:52:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:30,751 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-08 02:52:30,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:52:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-08 02:52:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:52:30,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:30,754 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:30,754 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:30,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-08 02:52:30,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:30,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:30,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:52:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:52:30,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:52:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:52:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:52:30,831 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-08 02:52:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:30,906 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 02:52:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:52:30,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-08 02:52:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:30,908 INFO L225 Difference]: With dead ends: 44 [2019-09-08 02:52:30,908 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:52:30,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 02:52:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:52:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-08 02:52:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 02:52:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-08 02:52:30,917 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-08 02:52:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:30,918 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-08 02:52:30,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:52:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-08 02:52:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:52:30,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:30,920 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:30,921 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:30,922 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-08 02:52:30,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:30,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:30,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:30,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:30,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:33,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:33,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 02:52:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:52:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:33,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:52:33,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:33,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:33,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-08 02:52:33,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 02:52:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 02:52:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2019-09-08 02:52:33,375 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-09-08 02:52:35,521 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_main_~main__index2~0 4294967296)))) (and (<= c_main_~main__index2~0 (+ .cse0 99999)) (<= (+ c_main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div c_main_~main__index1~0 4294967296)) c_main_~main__index2~0)) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) c_main_~main__index1~0) (* 4294967296 (div (+ c_main_~main__index1~0 (- 1)) 4294967296)) c_main_~main__index2~0 1) 4294967296)) 99998)))) is different from false [2019-09-08 02:52:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:52:35,696 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-08 02:52:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:52:35,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-09-08 02:52:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:52:35,697 INFO L225 Difference]: With dead ends: 45 [2019-09-08 02:52:35,697 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 02:52:35,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2019-09-08 02:52:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 02:52:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-08 02:52:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:52:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 02:52:35,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2019-09-08 02:52:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:52:35,721 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 02:52:35,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 02:52:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 02:52:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 02:52:35,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:52:35,722 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:52:35,723 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:52:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:52:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1779426667, now seen corresponding path program 1 times [2019-09-08 02:52:35,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:52:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:52:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:52:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:38,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:52:38,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:52:38,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:52:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:52:38,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 02:52:38,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:52:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:52:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:52:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2019-09-08 02:52:40,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 02:52:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 02:52:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2019-09-08 02:52:40,468 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2019-09-08 02:52:42,988 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-09-08 02:52:49,459 WARN L188 SmtUtils]: Spent 4.32 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 02:53:01,074 WARN L188 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-09-08 02:53:03,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div c_main_~main__index1~0 4294967296))) (.cse0 (div c_main_~main__index2~0 4294967296))) (and (<= (+ c_main_~main__index1~0 (* 4294967296 .cse0) 1) (+ .cse1 c_main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 c_main_~main__index2~0 (* (- 4294967296) .cse0) 4294867296) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) c_main_~main__index1~0) c_main_~main__index2~0 1) 4294967296)) (* 4294967296 (div (+ c_main_~main__index1~0 (- 2)) 4294967296)) 99998)))) is different from false [2019-09-08 02:53:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:53:11,070 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-09-08 02:53:11,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 02:53:11,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-09-08 02:53:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:53:11,136 INFO L225 Difference]: With dead ends: 43 [2019-09-08 02:53:11,136 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:53:11,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=68, Invalid=113, Unknown=5, NotChecked=24, Total=210 [2019-09-08 02:53:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:53:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:53:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:53:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:53:11,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-09-08 02:53:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:53:11,138 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:53:11,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 02:53:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:53:11,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:53:11,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:53:12,818 WARN L188 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-09-08 02:53:29,087 WARN L188 SmtUtils]: Spent 16.27 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 02:53:29,421 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2019-09-08 02:53:29,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:53:29,511 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:53:29,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:53:29,511 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:53:29,512 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-09-08 02:53:29,512 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-09-08 02:53:29,513 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse10 (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296))) (.cse11 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse12 (<= (+ main_~main__index1~0 .cse8 1) .cse9))) (or (and .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) main_~main__index1~0) .cse10 main_~main__index2~0 1) 4294967296)) 99998))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 .cse11 .cse12) (and .cse0 (<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ .cse10 main_~main__index2~0 1)) .cse11 .cse12))))) [2019-09-08 02:53:29,513 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-09-08 02:53:29,513 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-09-08 02:53:29,513 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-09-08 02:53:29,514 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-08 02:53:29,514 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-09-08 02:53:29,514 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-09-08 02:53:29,514 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~main__index1~0 4294967296))) (.cse0 (div main_~main__index2~0 4294967296))) (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 .cse0) 1) (+ .cse1 main_~main__index2~0)) (<= (+ (* 4294967296 (div (+ .cse1 main_~main__index2~0 (* (- 4294967296) .cse0) 4294867296) 4294967296)) 1) main_~main__index1~0))) [2019-09-08 02:53:29,514 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-09-08 02:53:29,514 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-09-08 02:53:29,515 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-09-08 02:53:29,515 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-08 02:53:29,515 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-09-08 02:53:29,515 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-09-08 02:53:29,515 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-09-08 02:53:29,515 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-09-08 02:53:29,515 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-09-08 02:53:29,516 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-09-08 02:53:29,516 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-09-08 02:53:29,516 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-09-08 02:53:29,516 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-08 02:53:29,516 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2019-09-08 02:53:29,516 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-09-08 02:53:29,516 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-09-08 02:53:29,517 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-09-08 02:53:29,517 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-09-08 02:53:29,517 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* (- 1) main_~main__index1~0) (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1) 4294967296)) 99998))) [2019-09-08 02:53:29,517 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-08 02:53:29,517 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-09-08 02:53:29,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,539 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,544 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:53:29 BoogieIcfgContainer [2019-09-08 02:53:29,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:53:29,552 INFO L168 Benchmark]: Toolchain (without parser) took 61695.56 ms. Allocated memory was 132.1 MB in the beginning and 263.7 MB in the end (delta: 131.6 MB). Free memory was 87.8 MB in the beginning and 132.2 MB in the end (delta: -44.4 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,553 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.94 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 87.6 MB in the beginning and 174.7 MB in the end (delta: -87.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,554 INFO L168 Benchmark]: Boogie Preprocessor took 42.91 ms. Allocated memory is still 198.7 MB. Free memory was 174.7 MB in the beginning and 172.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,555 INFO L168 Benchmark]: RCFGBuilder took 359.02 ms. Allocated memory is still 198.7 MB. Free memory was 172.8 MB in the beginning and 153.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,556 INFO L168 Benchmark]: TraceAbstraction took 60899.05 ms. Allocated memory was 198.7 MB in the beginning and 263.7 MB in the end (delta: 65.0 MB). Free memory was 152.9 MB in the beginning and 132.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:53:29,560 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.94 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 87.6 MB in the beginning and 174.7 MB in the end (delta: -87.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.91 ms. Allocated memory is still 198.7 MB. Free memory was 174.7 MB in the beginning and 172.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.02 ms. Allocated memory is still 198.7 MB. Free memory was 172.8 MB in the beginning and 153.5 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60899.05 ms. Allocated memory was 198.7 MB in the beginning and 263.7 MB in the end (delta: 65.0 MB). Free memory was 152.9 MB in the beginning and 132.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && main__index2 <= 4294967296 * ((-1 * main__index1 + 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) / 4294967296) + 99998 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-09-08 02:53:29,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,574 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,577 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:53:29,583 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((__VERIFIER_assert__cond == 1 && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) && main__index2 <= 4294967296 * ((-1 * main__index1 + 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) / 4294967296) + 99998) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || (((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * ((main__index2 + 1) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 4294967296 * ((4294967296 * (main__index1 / 4294967296) + main__index2 + -4294967296 * (main__index2 / 4294967296) + 4294867296) / 4294967296) + 1 <= main__index1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 60.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 18.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 207 SDslu, 318 SDs, 0 SdLazy, 200 SolverSat, 22 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 25.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 24 NumberOfFragments, 438 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1314 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 459 FormulaSimplificationTreeSizeReductionInter, 18.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 46098 SizeOfPredicates, 4 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...