/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:26:09,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:26:09,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:26:09,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:26:09,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:26:09,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:26:09,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:26:09,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:26:09,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:26:09,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:26:09,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:26:09,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:26:09,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:26:09,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:26:09,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:26:09,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:26:09,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:26:09,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:26:09,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:26:09,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:26:09,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:26:09,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:26:09,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:26:09,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:26:09,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:26:09,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:26:09,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:26:09,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:26:09,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:26:09,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:26:09,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:26:09,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:26:09,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:26:09,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:26:09,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:26:09,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:26:09,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:26:09,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:26:09,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:26:09,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:26:09,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:26:09,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:26:09,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:26:09,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:26:09,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:26:09,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:26:09,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:26:09,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:26:09,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:26:09,727 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:26:09,727 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 23:26:09,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:26:09,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:26:09,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:26:09,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:26:09,948 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:26:09,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-01-31 23:26:10,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef02983f0/270690aa41874cf08ed5a48c2b376856/FLAGeff9c04a3 [2022-01-31 23:26:10,356 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:26:10,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-01-31 23:26:10,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef02983f0/270690aa41874cf08ed5a48c2b376856/FLAGeff9c04a3 [2022-01-31 23:26:10,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef02983f0/270690aa41874cf08ed5a48c2b376856 [2022-01-31 23:26:10,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:26:10,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:26:10,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:26:10,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:26:10,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:26:10,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440d5f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10, skipping insertion in model container [2022-01-31 23:26:10,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:26:10,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:26:10,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-01-31 23:26:10,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:26:10,587 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:26:10,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c[406,419] [2022-01-31 23:26:10,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:26:10,617 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:26:10,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10 WrapperNode [2022-01-31 23:26:10,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:26:10,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:26:10,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:26:10,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:26:10,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:26:10,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:26:10,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:26:10,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:26:10,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (1/1) ... [2022-01-31 23:26:10,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:26:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:26:10,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 23:26:10,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 23:26:10,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:26:10,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:26:10,742 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:26:10,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 23:26:10,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 23:26:10,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:26:10,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:26:10,743 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:26:10,743 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:26:10,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:26:10,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 23:26:10,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 23:26:10,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 23:26:10,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:26:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:26:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:26:10,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:26:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:26:10,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:26:10,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:26:10,792 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:26:10,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:26:10,879 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:26:10,883 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:26:10,883 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 23:26:10,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:26:10 BoogieIcfgContainer [2022-01-31 23:26:10,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:26:10,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:26:10,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:26:10,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:26:10,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:26:10" (1/3) ... [2022-01-31 23:26:10,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ab52c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:26:10, skipping insertion in model container [2022-01-31 23:26:10,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:26:10" (2/3) ... [2022-01-31 23:26:10,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ab52c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:26:10, skipping insertion in model container [2022-01-31 23:26:10,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:26:10" (3/3) ... [2022-01-31 23:26:10,890 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-01-31 23:26:10,894 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:26:10,894 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:26:10,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:26:10,930 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=QVASR [2022-01-31 23:26:10,931 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:26:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 23:26:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:26:10,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:10,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:10,951 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-01-31 23:26:10,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:10,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101543761] [2022-01-31 23:26:10,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:10,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:11,012 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:26:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:11,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:11,176 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101543761] [2022-01-31 23:26:11,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1101543761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:11,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:11,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 23:26:11,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186735015] [2022-01-31 23:26:11,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:11,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 23:26:11,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 23:26:11,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 23:26:11,225 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:11,290 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-01-31 23:26:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 23:26:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:26:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:11,300 INFO L225 Difference]: With dead ends: 40 [2022-01-31 23:26:11,300 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 23:26:11,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 23:26:11,304 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:11,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:26:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 23:26:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 23:26:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-31 23:26:11,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-01-31 23:26:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:11,338 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-31 23:26:11,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-31 23:26:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 23:26:11,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:11,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:11,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:26:11,341 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-01-31 23:26:11,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126850651] [2022-01-31 23:26:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:11,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:11,347 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:26:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:11,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:11,728 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:11,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126850651] [2022-01-31 23:26:11,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [126850651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:11,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:11,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:26:11,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641401865] [2022-01-31 23:26:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:11,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:26:11,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:26:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:26:11,731 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:11,948 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-01-31 23:26:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:26:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-01-31 23:26:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:11,950 INFO L225 Difference]: With dead ends: 33 [2022-01-31 23:26:11,950 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 23:26:11,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:26:11,951 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:11,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:26:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 23:26:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-01-31 23:26:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-01-31 23:26:11,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-01-31 23:26:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:11,961 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-01-31 23:26:11,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-01-31 23:26:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:26:11,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:11,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:11,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:26:11,963 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-01-31 23:26:11,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:11,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735495467] [2022-01-31 23:26:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:12,084 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:26:12,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:12,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:12,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:12,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735495467] [2022-01-31 23:26:12,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1735495467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:12,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:12,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:26:12,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759464702] [2022-01-31 23:26:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:12,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:26:12,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:26:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:26:12,763 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:12,972 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-01-31 23:26:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:26:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:26:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:12,974 INFO L225 Difference]: With dead ends: 30 [2022-01-31 23:26:12,974 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 23:26:12,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:26:12,981 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:12,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 33 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 23:26:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 23:26:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 23:26:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-01-31 23:26:12,991 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2022-01-31 23:26:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:12,991 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-01-31 23:26:12,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-01-31 23:26:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 23:26:12,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:12,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:12,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:26:12,994 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:12,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 977611794, now seen corresponding path program 1 times [2022-01-31 23:26:12,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:12,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [993009242] [2022-01-31 23:26:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:13,017 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:26:13,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:13,995 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:13,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [993009242] [2022-01-31 23:26:13,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [993009242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:13,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:13,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:26:13,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776348332] [2022-01-31 23:26:13,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:13,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:26:13,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:26:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:26:13,997 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:16,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:19,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:21,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:23,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:23,838 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-01-31 23:26:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:26:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 23:26:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:23,839 INFO L225 Difference]: With dead ends: 28 [2022-01-31 23:26:23,839 INFO L226 Difference]: Without dead ends: 23 [2022-01-31 23:26:23,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:26:23,840 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:23,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 89 Invalid, 4 Unknown, 0 Unchecked, 9.3s Time] [2022-01-31 23:26:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-31 23:26:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-01-31 23:26:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-01-31 23:26:23,845 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-01-31 23:26:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:23,846 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-01-31 23:26:23,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-01-31 23:26:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:26:23,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:23,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:23,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:26:23,847 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash 275689641, now seen corresponding path program 1 times [2022-01-31 23:26:23,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:23,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [816789403] [2022-01-31 23:26:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:23,884 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:26:23,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:23,980 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [816789403] [2022-01-31 23:26:23,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [816789403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:23,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:23,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:26:23,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72694457] [2022-01-31 23:26:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:23,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:26:23,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:26:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:26:23,983 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:24,080 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-01-31 23:26:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:26:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:26:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:24,081 INFO L225 Difference]: With dead ends: 27 [2022-01-31 23:26:24,081 INFO L226 Difference]: Without dead ends: 19 [2022-01-31 23:26:24,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:26:24,082 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:24,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 23:26:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-31 23:26:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-31 23:26:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-01-31 23:26:24,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2022-01-31 23:26:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:24,086 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-01-31 23:26:24,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-01-31 23:26:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 23:26:24,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:26:24,087 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:26:24,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:26:24,087 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:26:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:26:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1821374134, now seen corresponding path program 1 times [2022-01-31 23:26:24,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:26:24,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513161693] [2022-01-31 23:26:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:26:24,128 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 23:26:24,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:26:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:26:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:26:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:26:40,863 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:26:40,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513161693] [2022-01-31 23:26:40,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1513161693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:26:40,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:26:40,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:26:40,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794578768] [2022-01-31 23:26:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:26:40,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:26:40,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:26:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:26:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=172, Unknown=5, NotChecked=0, Total=210 [2022-01-31 23:26:40,865 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:44,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:47,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-31 23:26:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:26:48,175 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-01-31 23:26:48,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:26:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 23:26:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:26:48,176 INFO L225 Difference]: With dead ends: 19 [2022-01-31 23:26:48,176 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:26:48,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=82, Invalid=293, Unknown=5, NotChecked=0, Total=380 [2022-01-31 23:26:48,177 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:26:48,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-01-31 23:26:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:26:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:26:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 23:26:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:26:48,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-01-31 23:26:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:26:48,178 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:26:48,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 23:26:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:26:48,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:26:48,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:26:48,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:26:48,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:26:49,013 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-01-31 23:26:49,014 INFO L854 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (let ((.cse1 (* (div main_~i~0 4294967296) 4294967296))) (let ((.cse0 (= (+ main_~j~0 .cse1) main_~i~0)) (.cse3 (= main_~k~0 main_~j~0)) (.cse2 (* (div main_~n~0 4294967296) 4294967296))) (or (and .cse0 (<= (+ main_~n~0 .cse1) (+ main_~i~0 .cse2)) (= main_~i~0 0) .cse3) (let ((.cse4 (mod main_~n~0 4294967296))) (and .cse0 (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse2)) .cse3 (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse4) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse4) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 .cse2)))) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))))) [2022-01-31 23:26:49,014 INFO L854 garLoopResultBuilder]: At program point L29-3(lines 29 31) the Hoare annotation is: (let ((.cse0 (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (.cse1 (= main_~k~0 main_~j~0))) (or (and .cse0 (= main_~i~0 0) .cse1) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse2 (mod main_~n~0 4294967296))) (and .cse0 .cse1 (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse2) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse2) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div main_~n~0 4294967296) 4294967296))))))) [2022-01-31 23:26:49,014 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 16 34) the Hoare annotation is: true [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point L25-2(lines 25 27) the Hoare annotation is: (let ((.cse3 (* (div main_~n~0 4294967296) 4294967296)) (.cse4 (* (div main_~i~0 4294967296) 4294967296))) (let ((.cse0 (= (+ main_~j~0 .cse4) main_~i~0)) (.cse1 (<= (+ main_~n~0 .cse4) (+ main_~i~0 .cse3)))) (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse2 (mod main_~n~0 4294967296))) (and .cse0 .cse1 (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse2) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse2) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 .cse3)))) (and .cse0 .cse1 (= main_~i~0 0))))) [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point L25-3(lines 25 27) the Hoare annotation is: (let ((.cse1 (* (div main_~i~0 4294967296) 4294967296))) (let ((.cse0 (= (+ main_~j~0 .cse1) main_~i~0)) (.cse2 (* (div main_~n~0 4294967296) 4294967296))) (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (and .cse0 (<= (+ main_~n~0 .cse1) (+ main_~i~0 .cse2)) (= main_~i~0 0)) (let ((.cse3 (mod main_~n~0 4294967296))) (and .cse0 (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 .cse2)) (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse3) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse3) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 .cse2))))))) [2022-01-31 23:26:49,015 INFO L861 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: true [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse0 (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 (* (div main_~n~0 4294967296) 4294967296))))) (or (and (= main_~i~0 0) .cse0) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (let ((.cse1 (mod main_~n~0 4294967296))) (and (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse1) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse1) .cse0)))) [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse2 (* (div main_~n~0 4294967296) 4294967296))) (let ((.cse0 (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 .cse2)))) (or (let ((.cse1 (mod main_~n~0 4294967296))) (and .cse0 (or (= main_~i~0 1) (and (< (mod (+ main_~i~0 4294967294) 4294967296) .cse1) (<= 1 main_~i~0))) (< (mod (+ main_~i~0 4294967295) 4294967296) .cse1) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ ~SIZE~0 .cse2)))) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (and .cse0 (= main_~i~0 0))))) [2022-01-31 23:26:49,015 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 16 34) the Hoare annotation is: true [2022-01-31 23:26:49,015 INFO L861 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-01-31 23:26:49,015 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 16 34) the Hoare annotation is: true [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 23:26:49,015 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-01-31 23:26:49,015 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L854 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-01-31 23:26:49,016 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L854 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-01-31 23:26:49,016 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L854 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 23:26:49,016 INFO L861 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-01-31 23:26:49,016 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2022-01-31 23:26:49,018 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-31 23:26:49,019 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 23:26:49,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:26:49 BoogieIcfgContainer [2022-01-31 23:26:49,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 23:26:49,039 INFO L158 Benchmark]: Toolchain (without parser) took 38654.81ms. Allocated memory was 190.8MB in the beginning and 275.8MB in the end (delta: 84.9MB). Free memory was 139.7MB in the beginning and 194.0MB in the end (delta: -54.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2022-01-31 23:26:49,039 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 23:26:49,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.93ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 139.5MB in the beginning and 205.0MB in the end (delta: -65.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-31 23:26:49,040 INFO L158 Benchmark]: Boogie Preprocessor took 33.81ms. Allocated memory is still 229.6MB. Free memory was 205.0MB in the beginning and 203.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 23:26:49,040 INFO L158 Benchmark]: RCFGBuilder took 232.02ms. Allocated memory is still 229.6MB. Free memory was 203.4MB in the beginning and 192.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-31 23:26:49,040 INFO L158 Benchmark]: TraceAbstraction took 38152.77ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 192.4MB in the beginning and 194.0MB in the end (delta: -1.6MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. [2022-01-31 23:26:49,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.93ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 139.5MB in the beginning and 205.0MB in the end (delta: -65.4MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.81ms. Allocated memory is still 229.6MB. Free memory was 205.0MB in the beginning and 203.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 232.02ms. Allocated memory is still 229.6MB. Free memory was 203.4MB in the beginning and 192.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38152.77ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 192.4MB in the beginning and 194.0MB in the end (delta: -1.6MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 72 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 54 PreInvPairs, 80 NumberOfFragments, 631 HoareAnnotationTreeSize, 54 FomulaSimplifications, 17 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 266 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((i == 0 && n + SIZE / 4294967296 * 4294967296 <= SIZE + n / 4294967296 * 4294967296) || !(20000001 <= SIZE)) || !(SIZE <= 20000001)) || (((i == 1 || ((i + 4294967294) % 4294967296 < n % 4294967296 && 1 <= i)) && (i + 4294967295) % 4294967296 < n % 4294967296) && n + SIZE / 4294967296 * 4294967296 <= SIZE + n / 4294967296 * 4294967296) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((j + i / 4294967296 * 4294967296 == i && n + i / 4294967296 * 4294967296 <= i + n / 4294967296 * 4294967296) && i == 0) && k == j) || (((((j + i / 4294967296 * 4294967296 == i && n + 4294967296 * (j / 4294967296) <= j + n / 4294967296 * 4294967296) && k == j) && (i == 1 || ((i + 4294967294) % 4294967296 < n % 4294967296 && 1 <= i))) && (i + 4294967295) % 4294967296 < n % 4294967296) && n + SIZE / 4294967296 * 4294967296 <= SIZE + n / 4294967296 * 4294967296)) || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((!(20000001 <= SIZE) || !(SIZE <= 20000001)) || ((((j + i / 4294967296 * 4294967296 == i && n + i / 4294967296 * 4294967296 <= i + n / 4294967296 * 4294967296) && (i == 1 || ((i + 4294967294) % 4294967296 < n % 4294967296 && 1 <= i))) && (i + 4294967295) % 4294967296 < n % 4294967296) && n + SIZE / 4294967296 * 4294967296 <= SIZE + n / 4294967296 * 4294967296)) || ((j + i / 4294967296 * 4294967296 == i && n + i / 4294967296 * 4294967296 <= i + n / 4294967296 * 4294967296) && i == 0) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 23:26:49,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...